24.06/13.99 YES 24.06/13.99 24.06/13.99 Ultimate: Cannot open display: 24.06/13.99 This is Ultimate 0.1.24-8dc7c08-m 24.06/13.99 [2019-03-28 11:55:32,446 INFO L170 SettingsManager]: Resetting all preferences to default values... 24.06/13.99 [2019-03-28 11:55:32,449 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 24.06/13.99 [2019-03-28 11:55:32,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 24.06/13.99 [2019-03-28 11:55:32,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 24.06/13.99 [2019-03-28 11:55:32,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 24.06/13.99 [2019-03-28 11:55:32,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 24.06/13.99 [2019-03-28 11:55:32,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 24.06/13.99 [2019-03-28 11:55:32,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 24.06/13.99 [2019-03-28 11:55:32,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 24.06/13.99 [2019-03-28 11:55:32,468 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 24.06/13.99 [2019-03-28 11:55:32,469 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 24.06/13.99 [2019-03-28 11:55:32,470 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 24.06/13.99 [2019-03-28 11:55:32,471 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 24.06/13.99 [2019-03-28 11:55:32,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 24.06/13.99 [2019-03-28 11:55:32,473 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 24.06/13.99 [2019-03-28 11:55:32,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 24.06/13.99 [2019-03-28 11:55:32,476 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 24.06/13.99 [2019-03-28 11:55:32,477 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 24.06/13.99 [2019-03-28 11:55:32,478 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 24.06/13.99 [2019-03-28 11:55:32,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 24.06/13.99 [2019-03-28 11:55:32,482 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 24.06/13.99 [2019-03-28 11:55:32,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 24.06/13.99 [2019-03-28 11:55:32,483 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 24.06/13.99 [2019-03-28 11:55:32,484 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 24.06/13.99 [2019-03-28 11:55:32,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 24.06/13.99 [2019-03-28 11:55:32,485 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 24.06/13.99 [2019-03-28 11:55:32,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 24.06/13.99 [2019-03-28 11:55:32,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 24.06/13.99 [2019-03-28 11:55:32,488 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 24.06/13.99 [2019-03-28 11:55:32,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 24.06/13.99 [2019-03-28 11:55:32,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 24.06/13.99 [2019-03-28 11:55:32,489 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 24.06/13.99 [2019-03-28 11:55:32,504 INFO L110 SettingsManager]: Loading preferences was successful 24.06/13.99 [2019-03-28 11:55:32,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 24.06/13.99 [2019-03-28 11:55:32,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 24.06/13.99 [2019-03-28 11:55:32,506 INFO L133 SettingsManager]: * Rewrite not-equals=true 24.06/13.99 [2019-03-28 11:55:32,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 24.06/13.99 [2019-03-28 11:55:32,506 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 24.06/13.99 [2019-03-28 11:55:32,506 INFO L133 SettingsManager]: * Use SBE=true 24.06/13.99 [2019-03-28 11:55:32,506 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 24.06/13.99 [2019-03-28 11:55:32,507 INFO L133 SettingsManager]: * Use old map elimination=false 24.06/13.99 [2019-03-28 11:55:32,507 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 24.06/13.99 [2019-03-28 11:55:32,507 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 24.06/13.99 [2019-03-28 11:55:32,507 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 24.06/13.99 [2019-03-28 11:55:32,507 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 24.06/13.99 [2019-03-28 11:55:32,507 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 24.06/13.99 [2019-03-28 11:55:32,508 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 24.06/13.99 [2019-03-28 11:55:32,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 24.06/13.99 [2019-03-28 11:55:32,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 24.06/13.99 [2019-03-28 11:55:32,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE 24.06/13.99 [2019-03-28 11:55:32,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 24.06/13.99 [2019-03-28 11:55:32,508 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 24.06/13.99 [2019-03-28 11:55:32,509 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 24.06/13.99 [2019-03-28 11:55:32,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 24.06/13.99 [2019-03-28 11:55:32,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 24.06/13.99 [2019-03-28 11:55:32,509 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 24.06/13.99 [2019-03-28 11:55:32,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.06/13.99 [2019-03-28 11:55:32,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 24.06/13.99 [2019-03-28 11:55:32,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 24.06/13.99 [2019-03-28 11:55:32,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 24.06/13.99 [2019-03-28 11:55:32,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 24.06/13.99 [2019-03-28 11:55:32,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 24.06/13.99 [2019-03-28 11:55:32,562 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 24.06/13.99 [2019-03-28 11:55:32,565 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 24.06/13.99 [2019-03-28 11:55:32,567 INFO L271 PluginConnector]: Initializing CDTParser... 24.06/13.99 [2019-03-28 11:55:32,567 INFO L276 PluginConnector]: CDTParser initialized 24.06/13.99 [2019-03-28 11:55:32,568 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 24.06/13.99 [2019-03-28 11:55:32,632 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/db38bd3fea854367b17bdee23918ef83/FLAG57daed6ed 24.06/13.99 [2019-03-28 11:55:33,181 INFO L307 CDTParser]: Found 1 translation units. 24.06/13.99 [2019-03-28 11:55:33,182 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 24.06/13.99 [2019-03-28 11:55:33,182 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 24.06/13.99 [2019-03-28 11:55:33,189 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/db38bd3fea854367b17bdee23918ef83/FLAG57daed6ed 24.06/13.99 [2019-03-28 11:55:33,605 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/db38bd3fea854367b17bdee23918ef83 24.06/13.99 [2019-03-28 11:55:33,616 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 24.06/13.99 [2019-03-28 11:55:33,618 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 24.06/13.99 [2019-03-28 11:55:33,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 24.06/13.99 [2019-03-28 11:55:33,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 24.06/13.99 [2019-03-28 11:55:33,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 24.06/13.99 [2019-03-28 11:55:33,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca92ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33, skipping insertion in model container 24.06/13.99 [2019-03-28 11:55:33,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 24.06/13.99 [2019-03-28 11:55:33,653 INFO L176 MainTranslator]: Built tables and reachable declarations 24.06/13.99 [2019-03-28 11:55:33,816 INFO L206 PostProcessor]: Analyzing one entry point: main 24.06/13.99 [2019-03-28 11:55:33,828 INFO L191 MainTranslator]: Completed pre-run 24.06/13.99 [2019-03-28 11:55:33,846 INFO L206 PostProcessor]: Analyzing one entry point: main 24.06/13.99 [2019-03-28 11:55:33,918 INFO L195 MainTranslator]: Completed translation 24.06/13.99 [2019-03-28 11:55:33,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33 WrapperNode 24.06/13.99 [2019-03-28 11:55:33,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 24.06/13.99 [2019-03-28 11:55:33,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 24.06/13.99 [2019-03-28 11:55:33,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 24.06/13.99 [2019-03-28 11:55:33,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 24.06/13.99 [2019-03-28 11:55:33,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 24.06/13.99 [2019-03-28 11:55:33,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 24.06/13.99 [2019-03-28 11:55:33,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 24.06/13.99 [2019-03-28 11:55:33,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized 24.06/13.99 [2019-03-28 11:55:33,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 [2019-03-28 11:55:33,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 24.06/13.99 [2019-03-28 11:55:33,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 24.06/13.99 [2019-03-28 11:55:33,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... 24.06/13.99 [2019-03-28 11:55:33,987 INFO L276 PluginConnector]: RCFGBuilder initialized 24.06/13.99 [2019-03-28 11:55:33,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (1/1) ... 24.06/13.99 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.06/13.99 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 24.06/13.99 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 24.06/13.99 [2019-03-28 11:55:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 24.06/13.99 [2019-03-28 11:55:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap 24.06/13.99 [2019-03-28 11:55:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 24.06/13.99 [2019-03-28 11:55:34,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 24.06/13.99 [2019-03-28 11:55:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 24.06/13.99 [2019-03-28 11:55:34,261 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 24.06/13.99 [2019-03-28 11:55:34,262 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. 24.06/13.99 [2019-03-28 11:55:34,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:34 BoogieIcfgContainer 24.06/13.99 [2019-03-28 11:55:34,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 24.06/13.99 [2019-03-28 11:55:34,264 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 24.06/13.99 [2019-03-28 11:55:34,264 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 24.06/13.99 [2019-03-28 11:55:34,267 INFO L276 PluginConnector]: BlockEncodingV2 initialized 24.06/13.99 [2019-03-28 11:55:34,267 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:34" (1/1) ... 24.06/13.99 [2019-03-28 11:55:34,284 INFO L313 BlockEncoder]: Initial Icfg 28 locations, 32 edges 24.06/13.99 [2019-03-28 11:55:34,285 INFO L258 BlockEncoder]: Using Remove infeasible edges 24.06/13.99 [2019-03-28 11:55:34,286 INFO L263 BlockEncoder]: Using Maximize final states 24.06/13.99 [2019-03-28 11:55:34,286 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 24.06/13.99 [2019-03-28 11:55:34,287 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 24.06/13.99 [2019-03-28 11:55:34,288 INFO L296 BlockEncoder]: Using Remove sink states 24.06/13.99 [2019-03-28 11:55:34,289 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 24.06/13.99 [2019-03-28 11:55:34,289 INFO L179 BlockEncoder]: Using Rewrite not-equals 24.06/13.99 [2019-03-28 11:55:34,311 INFO L185 BlockEncoder]: Using Use SBE 24.06/13.99 [2019-03-28 11:55:34,342 INFO L200 BlockEncoder]: SBE split 12 edges 24.06/13.99 [2019-03-28 11:55:34,347 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 24.06/13.99 [2019-03-28 11:55:34,348 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.06/13.99 [2019-03-28 11:55:34,377 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding 24.06/13.99 [2019-03-28 11:55:34,379 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 24.06/13.99 [2019-03-28 11:55:34,381 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 24.06/13.99 [2019-03-28 11:55:34,381 INFO L71 MaximizeFinalStates]: 0 new accepting states 24.06/13.99 [2019-03-28 11:55:34,382 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 24.06/13.99 [2019-03-28 11:55:34,382 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 24.06/13.99 [2019-03-28 11:55:34,383 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 42 edges 24.06/13.99 [2019-03-28 11:55:34,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:55:34 BasicIcfg 24.06/13.99 [2019-03-28 11:55:34,383 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 24.06/13.99 [2019-03-28 11:55:34,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 24.06/13.99 [2019-03-28 11:55:34,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... 24.06/13.99 [2019-03-28 11:55:34,387 INFO L276 PluginConnector]: TraceAbstraction initialized 24.06/13.99 [2019-03-28 11:55:34,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 11:55:33" (1/4) ... 24.06/13.99 [2019-03-28 11:55:34,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3975715b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:55:34, skipping insertion in model container 24.06/13.99 [2019-03-28 11:55:34,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (2/4) ... 24.06/13.99 [2019-03-28 11:55:34,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3975715b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 11:55:34, skipping insertion in model container 24.06/13.99 [2019-03-28 11:55:34,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:34" (3/4) ... 24.06/13.99 [2019-03-28 11:55:34,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3975715b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:55:34, skipping insertion in model container 24.06/13.99 [2019-03-28 11:55:34,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:55:34" (4/4) ... 24.06/13.99 [2019-03-28 11:55:34,391 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.06/13.99 [2019-03-28 11:55:34,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 24.06/13.99 [2019-03-28 11:55:34,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. 24.06/13.99 [2019-03-28 11:55:34,426 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. 24.06/13.99 [2019-03-28 11:55:34,455 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.06/13.99 [2019-03-28 11:55:34,456 INFO L382 AbstractCegarLoop]: Interprodecural is true 24.06/13.99 [2019-03-28 11:55:34,456 INFO L383 AbstractCegarLoop]: Hoare is true 24.06/13.99 [2019-03-28 11:55:34,456 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 24.06/13.99 [2019-03-28 11:55:34,457 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 24.06/13.99 [2019-03-28 11:55:34,457 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.06/13.99 [2019-03-28 11:55:34,457 INFO L387 AbstractCegarLoop]: Difference is false 24.06/13.99 [2019-03-28 11:55:34,457 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 24.06/13.99 [2019-03-28 11:55:34,457 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 24.06/13.99 [2019-03-28 11:55:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. 24.06/13.99 [2019-03-28 11:55:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 24.06/13.99 [2019-03-28 11:55:34,478 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:34,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:34,479 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash 5063892, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:34,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:34,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:34,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:34,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:36,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:36,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.06/13.99 [2019-03-28 11:55:36,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.06/13.99 [2019-03-28 11:55:36,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.06/13.99 [2019-03-28 11:55:36,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:36,333 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. 24.06/13.99 [2019-03-28 11:55:36,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/13.99 [2019-03-28 11:55:36,428 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. 24.06/13.99 [2019-03-28 11:55:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:36,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 24.06/13.99 [2019-03-28 11:55:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/13.99 [2019-03-28 11:55:36,443 INFO L225 Difference]: With dead ends: 32 24.06/13.99 [2019-03-28 11:55:36,444 INFO L226 Difference]: Without dead ends: 18 24.06/13.99 [2019-03-28 11:55:36,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 24.06/13.99 [2019-03-28 11:55:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 24.06/13.99 [2019-03-28 11:55:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 24.06/13.99 [2019-03-28 11:55:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. 24.06/13.99 [2019-03-28 11:55:36,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 4 24.06/13.99 [2019-03-28 11:55:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/13.99 [2019-03-28 11:55:36,486 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. 24.06/13.99 [2019-03-28 11:55:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. 24.06/13.99 [2019-03-28 11:55:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 24.06/13.99 [2019-03-28 11:55:36,487 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:36,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:36,487 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:36,488 INFO L82 PathProgramCache]: Analyzing trace with hash 5063894, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:36,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:36,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:36,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:36,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.06/13.99 [2019-03-28 11:55:36,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 24.06/13.99 [2019-03-28 11:55:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 24.06/13.99 [2019-03-28 11:55:36,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 24.06/13.99 [2019-03-28 11:55:36,525 INFO L87 Difference]: Start difference. First operand 18 states and 38 transitions. Second operand 4 states. 24.06/13.99 [2019-03-28 11:55:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/13.99 [2019-03-28 11:55:36,599 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. 24.06/13.99 [2019-03-28 11:55:36,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 24.06/13.99 [2019-03-28 11:55:36,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 24.06/13.99 [2019-03-28 11:55:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/13.99 [2019-03-28 11:55:36,600 INFO L225 Difference]: With dead ends: 19 24.06/13.99 [2019-03-28 11:55:36,600 INFO L226 Difference]: Without dead ends: 18 24.06/13.99 [2019-03-28 11:55:36,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 24.06/13.99 [2019-03-28 11:55:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 24.06/13.99 [2019-03-28 11:55:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 24.06/13.99 [2019-03-28 11:55:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 24.06/13.99 [2019-03-28 11:55:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. 24.06/13.99 [2019-03-28 11:55:36,606 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 4 24.06/13.99 [2019-03-28 11:55:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/13.99 [2019-03-28 11:55:36,606 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. 24.06/13.99 [2019-03-28 11:55:36,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 24.06/13.99 [2019-03-28 11:55:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. 24.06/13.99 [2019-03-28 11:55:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 24.06/13.99 [2019-03-28 11:55:36,607 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:36,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:36,607 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash 5063895, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:36,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:36,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:36,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:36,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.06/13.99 [2019-03-28 11:55:36,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.06/13.99 [2019-03-28 11:55:36,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.06/13.99 [2019-03-28 11:55:36,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:36,636 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 3 states. 24.06/13.99 [2019-03-28 11:55:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/13.99 [2019-03-28 11:55:36,704 INFO L93 Difference]: Finished difference Result 18 states and 37 transitions. 24.06/13.99 [2019-03-28 11:55:36,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:36,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 24.06/13.99 [2019-03-28 11:55:36,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/13.99 [2019-03-28 11:55:36,705 INFO L225 Difference]: With dead ends: 18 24.06/13.99 [2019-03-28 11:55:36,705 INFO L226 Difference]: Without dead ends: 17 24.06/13.99 [2019-03-28 11:55:36,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. 24.06/13.99 [2019-03-28 11:55:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. 24.06/13.99 [2019-03-28 11:55:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. 24.06/13.99 [2019-03-28 11:55:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. 24.06/13.99 [2019-03-28 11:55:36,710 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 36 transitions. Word has length 4 24.06/13.99 [2019-03-28 11:55:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/13.99 [2019-03-28 11:55:36,710 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 36 transitions. 24.06/13.99 [2019-03-28 11:55:36,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 36 transitions. 24.06/13.99 [2019-03-28 11:55:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 24.06/13.99 [2019-03-28 11:55:36,711 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:36,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:36,711 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash 156981814, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:36,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:36,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:36,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:36,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.06/13.99 [2019-03-28 11:55:36,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.06/13.99 [2019-03-28 11:55:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.06/13.99 [2019-03-28 11:55:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:36,765 INFO L87 Difference]: Start difference. First operand 17 states and 36 transitions. Second operand 3 states. 24.06/13.99 [2019-03-28 11:55:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/13.99 [2019-03-28 11:55:36,820 INFO L93 Difference]: Finished difference Result 17 states and 36 transitions. 24.06/13.99 [2019-03-28 11:55:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:36,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 24.06/13.99 [2019-03-28 11:55:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/13.99 [2019-03-28 11:55:36,821 INFO L225 Difference]: With dead ends: 17 24.06/13.99 [2019-03-28 11:55:36,821 INFO L226 Difference]: Without dead ends: 14 24.06/13.99 [2019-03-28 11:55:36,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:36,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. 24.06/13.99 [2019-03-28 11:55:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. 24.06/13.99 [2019-03-28 11:55:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. 24.06/13.99 [2019-03-28 11:55:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. 24.06/13.99 [2019-03-28 11:55:36,825 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 5 24.06/13.99 [2019-03-28 11:55:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/13.99 [2019-03-28 11:55:36,826 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. 24.06/13.99 [2019-03-28 11:55:36,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. 24.06/13.99 [2019-03-28 11:55:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 24.06/13.99 [2019-03-28 11:55:36,826 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:36,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:36,827 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash 156981816, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:36,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:36,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:36,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.06/13.99 [2019-03-28 11:55:36,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 24.06/13.99 [2019-03-28 11:55:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 24.06/13.99 [2019-03-28 11:55:36,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 24.06/13.99 [2019-03-28 11:55:36,863 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 4 states. 24.06/13.99 [2019-03-28 11:55:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/13.99 [2019-03-28 11:55:36,946 INFO L93 Difference]: Finished difference Result 27 states and 54 transitions. 24.06/13.99 [2019-03-28 11:55:36,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 24.06/13.99 [2019-03-28 11:55:36,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 24.06/13.99 [2019-03-28 11:55:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/13.99 [2019-03-28 11:55:36,947 INFO L225 Difference]: With dead ends: 27 24.06/13.99 [2019-03-28 11:55:36,947 INFO L226 Difference]: Without dead ends: 24 24.06/13.99 [2019-03-28 11:55:36,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 24.06/13.99 [2019-03-28 11:55:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 24.06/13.99 [2019-03-28 11:55:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. 24.06/13.99 [2019-03-28 11:55:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 24.06/13.99 [2019-03-28 11:55:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. 24.06/13.99 [2019-03-28 11:55:36,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 51 transitions. Word has length 5 24.06/13.99 [2019-03-28 11:55:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/13.99 [2019-03-28 11:55:36,954 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 51 transitions. 24.06/13.99 [2019-03-28 11:55:36,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 24.06/13.99 [2019-03-28 11:55:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 51 transitions. 24.06/13.99 [2019-03-28 11:55:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 24.06/13.99 [2019-03-28 11:55:36,954 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:36,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:36,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash 156981817, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:36,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:36,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:37,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:37,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 24.06/13.99 [2019-03-28 11:55:37,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 24.06/13.99 [2019-03-28 11:55:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 24.06/13.99 [2019-03-28 11:55:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 24.06/13.99 [2019-03-28 11:55:37,005 INFO L87 Difference]: Start difference. First operand 21 states and 51 transitions. Second operand 5 states. 24.06/13.99 [2019-03-28 11:55:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/13.99 [2019-03-28 11:55:37,108 INFO L93 Difference]: Finished difference Result 24 states and 51 transitions. 24.06/13.99 [2019-03-28 11:55:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 24.06/13.99 [2019-03-28 11:55:37,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 24.06/13.99 [2019-03-28 11:55:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/13.99 [2019-03-28 11:55:37,110 INFO L225 Difference]: With dead ends: 24 24.06/13.99 [2019-03-28 11:55:37,110 INFO L226 Difference]: Without dead ends: 20 24.06/13.99 [2019-03-28 11:55:37,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 24.06/13.99 [2019-03-28 11:55:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. 24.06/13.99 [2019-03-28 11:55:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. 24.06/13.99 [2019-03-28 11:55:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. 24.06/13.99 [2019-03-28 11:55:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. 24.06/13.99 [2019-03-28 11:55:37,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 47 transitions. Word has length 5 24.06/13.99 [2019-03-28 11:55:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/13.99 [2019-03-28 11:55:37,115 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 47 transitions. 24.06/13.99 [2019-03-28 11:55:37,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 24.06/13.99 [2019-03-28 11:55:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. 24.06/13.99 [2019-03-28 11:55:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 24.06/13.99 [2019-03-28 11:55:37,116 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:37,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:37,116 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -648955393, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:37,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:37,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:37,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:37,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:37,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:37,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.06/13.99 [2019-03-28 11:55:37,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.06/13.99 [2019-03-28 11:55:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.06/13.99 [2019-03-28 11:55:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:37,146 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. Second operand 3 states. 24.06/13.99 [2019-03-28 11:55:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/13.99 [2019-03-28 11:55:37,213 INFO L93 Difference]: Finished difference Result 35 states and 79 transitions. 24.06/13.99 [2019-03-28 11:55:37,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:37,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 24.06/13.99 [2019-03-28 11:55:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/13.99 [2019-03-28 11:55:37,215 INFO L225 Difference]: With dead ends: 35 24.06/13.99 [2019-03-28 11:55:37,215 INFO L226 Difference]: Without dead ends: 24 24.06/13.99 [2019-03-28 11:55:37,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. 24.06/13.99 [2019-03-28 11:55:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. 24.06/13.99 [2019-03-28 11:55:37,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. 24.06/13.99 [2019-03-28 11:55:37,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. 24.06/13.99 [2019-03-28 11:55:37,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 49 transitions. Word has length 9 24.06/13.99 [2019-03-28 11:55:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/13.99 [2019-03-28 11:55:37,221 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 49 transitions. 24.06/13.99 [2019-03-28 11:55:37,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.06/13.99 [2019-03-28 11:55:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. 24.06/13.99 [2019-03-28 11:55:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 24.06/13.99 [2019-03-28 11:55:37,222 INFO L394 BasicCegarLoop]: Found error trace 24.06/13.99 [2019-03-28 11:55:37,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] 24.06/13.99 [2019-03-28 11:55:37,222 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/13.99 [2019-03-28 11:55:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/13.99 [2019-03-28 11:55:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash -648925602, now seen corresponding path program 1 times 24.06/13.99 [2019-03-28 11:55:37,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/13.99 [2019-03-28 11:55:37,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/13.99 [2019-03-28 11:55:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/13.99 [2019-03-28 11:55:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/13.99 [2019-03-28 11:55:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/13.99 [2019-03-28 11:55:37,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/13.99 [2019-03-28 11:55:37,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.06/13.99 [2019-03-28 11:55:37,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 24.06/13.99 [2019-03-28 11:55:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.06/13.99 [2019-03-28 11:55:37,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/13.99 [2019-03-28 11:55:37,251 INFO L87 Difference]: Start difference. First operand 22 states and 49 transitions. Second operand 3 states. 24.06/14.00 [2019-03-28 11:55:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:37,313 INFO L93 Difference]: Finished difference Result 37 states and 86 transitions. 24.06/14.00 [2019-03-28 11:55:37,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.06/14.00 [2019-03-28 11:55:37,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 24.06/14.00 [2019-03-28 11:55:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/14.00 [2019-03-28 11:55:37,314 INFO L225 Difference]: With dead ends: 37 24.06/14.00 [2019-03-28 11:55:37,315 INFO L226 Difference]: Without dead ends: 21 24.06/14.00 [2019-03-28 11:55:37,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/14.00 [2019-03-28 11:55:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. 24.06/14.00 [2019-03-28 11:55:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. 24.06/14.00 [2019-03-28 11:55:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 24.06/14.00 [2019-03-28 11:55:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. 24.06/14.00 [2019-03-28 11:55:37,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 9 24.06/14.00 [2019-03-28 11:55:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/14.00 [2019-03-28 11:55:37,319 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 42 transitions. 24.06/14.00 [2019-03-28 11:55:37,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 24.06/14.00 [2019-03-28 11:55:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 42 transitions. 24.06/14.00 [2019-03-28 11:55:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 24.06/14.00 [2019-03-28 11:55:37,320 INFO L394 BasicCegarLoop]: Found error trace 24.06/14.00 [2019-03-28 11:55:37,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:37,321 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/14.00 [2019-03-28 11:55:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash -877373307, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:37,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:37,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:37,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:37,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 24.06/14.00 [2019-03-28 11:55:37,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 24.06/14.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.06/14.00 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 24.06/14.00 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 24.06/14.00 [2019-03-28 11:55:37,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:37,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core 24.06/14.00 [2019-03-28 11:55:37,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.06/14.00 [2019-03-28 11:55:37,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:37,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 24.06/14.00 [2019-03-28 11:55:37,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 24.06/14.00 [2019-03-28 11:55:37,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 24.06/14.00 [2019-03-28 11:55:37,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 24.06/14.00 [2019-03-28 11:55:37,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 24.06/14.00 [2019-03-28 11:55:37,462 INFO L87 Difference]: Start difference. First operand 21 states and 42 transitions. Second operand 6 states. 24.06/14.00 [2019-03-28 11:55:37,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:37,555 INFO L93 Difference]: Finished difference Result 25 states and 43 transitions. 24.06/14.00 [2019-03-28 11:55:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 24.06/14.00 [2019-03-28 11:55:37,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 24.06/14.00 [2019-03-28 11:55:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/14.00 [2019-03-28 11:55:37,556 INFO L225 Difference]: With dead ends: 25 24.06/14.00 [2019-03-28 11:55:37,556 INFO L226 Difference]: Without dead ends: 22 24.06/14.00 [2019-03-28 11:55:37,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 24.06/14.00 [2019-03-28 11:55:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 24.06/14.00 [2019-03-28 11:55:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. 24.06/14.00 [2019-03-28 11:55:37,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. 24.06/14.00 [2019-03-28 11:55:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. 24.06/14.00 [2019-03-28 11:55:37,560 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 11 24.06/14.00 [2019-03-28 11:55:37,561 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/14.00 [2019-03-28 11:55:37,562 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. 24.06/14.00 [2019-03-28 11:55:37,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 24.06/14.00 [2019-03-28 11:55:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. 24.06/14.00 [2019-03-28 11:55:37,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 24.06/14.00 [2019-03-28 11:55:37,562 INFO L394 BasicCegarLoop]: Found error trace 24.06/14.00 [2019-03-28 11:55:37,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:37,563 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/14.00 [2019-03-28 11:55:37,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:37,563 INFO L82 PathProgramCache]: Analyzing trace with hash -877373306, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:37,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:37,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 24.06/14.00 [2019-03-28 11:55:37,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 24.06/14.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.06/14.00 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 24.06/14.00 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 24.06/14.00 [2019-03-28 11:55:37,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:37,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 23 conjunts are in the unsatisfiable core 24.06/14.00 [2019-03-28 11:55:37,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.06/14.00 [2019-03-28 11:55:37,794 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 24.06/14.00 [2019-03-28 11:55:37,795 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:37,805 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:37,806 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:37,807 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 24.06/14.00 [2019-03-28 11:55:37,849 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:37,849 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 24.06/14.00 [2019-03-28 11:55:37,854 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 24.06/14.00 [2019-03-28 11:55:37,865 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:37,871 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. 24.06/14.00 [2019-03-28 11:55:37,872 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 24.06/14.00 [2019-03-28 11:55:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:37,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 24.06/14.00 [2019-03-28 11:55:37,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 24.06/14.00 [2019-03-28 11:55:37,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states 24.06/14.00 [2019-03-28 11:55:37,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. 24.06/14.00 [2019-03-28 11:55:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 24.06/14.00 [2019-03-28 11:55:37,947 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 11 states. 24.06/14.00 [2019-03-28 11:55:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:38,369 INFO L93 Difference]: Finished difference Result 29 states and 56 transitions. 24.06/14.00 [2019-03-28 11:55:38,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 24.06/14.00 [2019-03-28 11:55:38,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 24.06/14.00 [2019-03-28 11:55:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/14.00 [2019-03-28 11:55:38,371 INFO L225 Difference]: With dead ends: 29 24.06/14.00 [2019-03-28 11:55:38,371 INFO L226 Difference]: Without dead ends: 22 24.06/14.00 [2019-03-28 11:55:38,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 24.06/14.00 [2019-03-28 11:55:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. 24.06/14.00 [2019-03-28 11:55:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. 24.06/14.00 [2019-03-28 11:55:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 24.06/14.00 [2019-03-28 11:55:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. 24.06/14.00 [2019-03-28 11:55:38,375 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 11 24.06/14.00 [2019-03-28 11:55:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/14.00 [2019-03-28 11:55:38,376 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. 24.06/14.00 [2019-03-28 11:55:38,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. 24.06/14.00 [2019-03-28 11:55:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. 24.06/14.00 [2019-03-28 11:55:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 24.06/14.00 [2019-03-28 11:55:38,376 INFO L394 BasicCegarLoop]: Found error trace 24.06/14.00 [2019-03-28 11:55:38,377 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:38,377 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/14.00 [2019-03-28 11:55:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:38,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1005147885, now seen corresponding path program 2 times 24.06/14.00 [2019-03-28 11:55:38,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:38,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:38,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:38,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 24.06/14.00 [2019-03-28 11:55:38,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 24.06/14.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.06/14.00 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 24.06/14.00 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 24.06/14.00 [2019-03-28 11:55:38,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 24.06/14.00 [2019-03-28 11:55:38,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 24.06/14.00 [2019-03-28 11:55:38,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:38,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core 24.06/14.00 [2019-03-28 11:55:38,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.06/14.00 [2019-03-28 11:55:38,783 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 24.06/14.00 [2019-03-28 11:55:38,783 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:38,787 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:38,787 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:38,788 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 24.06/14.00 [2019-03-28 11:55:38,805 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 24.06/14.00 [2019-03-28 11:55:38,805 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:38,810 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:38,811 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:38,811 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 24.06/14.00 [2019-03-28 11:55:38,847 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:38,848 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 24.06/14.00 [2019-03-28 11:55:38,849 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 24.06/14.00 [2019-03-28 11:55:38,859 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:38,861 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:38,862 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 24.06/14.00 [2019-03-28 11:55:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:38,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 24.06/14.00 [2019-03-28 11:55:38,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 24.06/14.00 [2019-03-28 11:55:38,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states 24.06/14.00 [2019-03-28 11:55:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 24.06/14.00 [2019-03-28 11:55:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 24.06/14.00 [2019-03-28 11:55:38,937 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 12 states. 24.06/14.00 [2019-03-28 11:55:39,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:39,455 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. 24.06/14.00 [2019-03-28 11:55:39,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 24.06/14.00 [2019-03-28 11:55:39,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 24.06/14.00 [2019-03-28 11:55:39,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/14.00 [2019-03-28 11:55:39,457 INFO L225 Difference]: With dead ends: 34 24.06/14.00 [2019-03-28 11:55:39,457 INFO L226 Difference]: Without dead ends: 33 24.06/14.00 [2019-03-28 11:55:39,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 24.06/14.00 [2019-03-28 11:55:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. 24.06/14.00 [2019-03-28 11:55:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. 24.06/14.00 [2019-03-28 11:55:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 24.06/14.00 [2019-03-28 11:55:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. 24.06/14.00 [2019-03-28 11:55:39,462 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 17 24.06/14.00 [2019-03-28 11:55:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/14.00 [2019-03-28 11:55:39,463 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 47 transitions. 24.06/14.00 [2019-03-28 11:55:39,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. 24.06/14.00 [2019-03-28 11:55:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 47 transitions. 24.06/14.00 [2019-03-28 11:55:39,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 24.06/14.00 [2019-03-28 11:55:39,464 INFO L394 BasicCegarLoop]: Found error trace 24.06/14.00 [2019-03-28 11:55:39,464 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:39,464 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION]=== 24.06/14.00 [2019-03-28 11:55:39,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:39,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2085270242, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:39,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:39,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:39,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:39,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 24.06/14.00 [2019-03-28 11:55:39,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 24.06/14.00 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 24.06/14.00 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 24.06/14.00 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 24.06/14.00 [2019-03-28 11:55:39,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:39,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjunts are in the unsatisfiable core 24.06/14.00 [2019-03-28 11:55:39,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.06/14.00 [2019-03-28 11:55:39,631 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 24.06/14.00 [2019-03-28 11:55:39,631 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:39,636 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:39,637 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:39,637 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 24.06/14.00 [2019-03-28 11:55:39,644 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 24.06/14.00 [2019-03-28 11:55:39,644 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:39,646 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:39,647 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:39,647 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 24.06/14.00 [2019-03-28 11:55:39,662 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:39,662 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 24.06/14.00 [2019-03-28 11:55:39,663 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 24.06/14.00 [2019-03-28 11:55:39,671 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 24.06/14.00 [2019-03-28 11:55:39,671 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 24.06/14.00 [2019-03-28 11:55:39,672 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 24.06/14.00 [2019-03-28 11:55:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:39,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 24.06/14.00 [2019-03-28 11:55:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 24.06/14.00 [2019-03-28 11:55:39,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states 24.06/14.00 [2019-03-28 11:55:39,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 24.06/14.00 [2019-03-28 11:55:39,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 24.06/14.00 [2019-03-28 11:55:39,730 INFO L87 Difference]: Start difference. First operand 24 states and 47 transitions. Second operand 9 states. 24.06/14.00 [2019-03-28 11:55:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:39,828 INFO L93 Difference]: Finished difference Result 24 states and 47 transitions. 24.06/14.00 [2019-03-28 11:55:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 24.06/14.00 [2019-03-28 11:55:39,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 24.06/14.00 [2019-03-28 11:55:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 24.06/14.00 [2019-03-28 11:55:39,829 INFO L225 Difference]: With dead ends: 24 24.06/14.00 [2019-03-28 11:55:39,829 INFO L226 Difference]: Without dead ends: 0 24.06/14.00 [2019-03-28 11:55:39,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 24.06/14.00 [2019-03-28 11:55:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 24.06/14.00 [2019-03-28 11:55:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 24.06/14.00 [2019-03-28 11:55:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 24.06/14.00 [2019-03-28 11:55:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:39,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 24.06/14.00 [2019-03-28 11:55:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. 24.06/14.00 [2019-03-28 11:55:39,831 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:39,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. 24.06/14.00 [2019-03-28 11:55:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:39,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 24.06/14.00 [2019-03-28 11:55:39,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:39,970 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 24.06/14.00 [2019-03-28 11:55:39,979 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,979 INFO L448 ceAbstractionStarter]: For program point L29-2(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,979 INFO L448 ceAbstractionStarter]: For program point L29-3(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,980 INFO L448 ceAbstractionStarter]: For program point L29-4(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,980 INFO L448 ceAbstractionStarter]: For program point L29-6(lines 29 30) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,980 INFO L444 ceAbstractionStarter]: At program point L29-8(lines 29 30) the Hoare annotation is: (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_cstrchr_~s.base))) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse2 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse3 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse4 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrchr_~s.base) (- 1))) 0) (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (<= 0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)))) (.cse5 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~length~0 Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (= (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (- 1))) 0) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) (select |#length| ULTIMATE.start_cstrchr_~s.base)) (<= ULTIMATE.start_cstrchr_~s.offset ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset))) (= 0 ULTIMATE.start_cstrchr_~s.offset) .cse4 .cse5) (and (<= 1 ULTIMATE.start_cstrchr_~s.offset) (<= (+ ULTIMATE.start_cstrchr_~s.offset 1) (select |#length| ULTIMATE.start_cstrchr_~s.base)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) 24.06/14.00 [2019-03-28 11:55:39,980 INFO L448 ceAbstractionStarter]: For program point L29-9(lines 29 30) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,982 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) 24.06/14.00 [2019-03-28 11:55:39,982 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,982 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. 24.06/14.00 [2019-03-28 11:55:39,982 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 24.06/14.00 [2019-03-28 11:55:39,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,993 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:39,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:39,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:39,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:39,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:39,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:39,998 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:39,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:39,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:39,999 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,007 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:40,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:40,010 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:40,011 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,012 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:40,013 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,015 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:40,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:55:40 BasicIcfg 24.06/14.00 [2019-03-28 11:55:40,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 24.06/14.00 [2019-03-28 11:55:40,017 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 24.06/14.00 [2019-03-28 11:55:40,017 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 24.06/14.00 [2019-03-28 11:55:40,021 INFO L276 PluginConnector]: BuchiAutomizer initialized 24.06/14.00 [2019-03-28 11:55:40,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.06/14.00 [2019-03-28 11:55:40,022 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 11:55:33" (1/5) ... 24.06/14.00 [2019-03-28 11:55:40,022 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c9c2536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:55:40, skipping insertion in model container 24.06/14.00 [2019-03-28 11:55:40,022 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.06/14.00 [2019-03-28 11:55:40,023 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 11:55:33" (2/5) ... 24.06/14.00 [2019-03-28 11:55:40,023 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c9c2536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 11:55:40, skipping insertion in model container 24.06/14.00 [2019-03-28 11:55:40,023 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.06/14.00 [2019-03-28 11:55:40,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 11:55:34" (3/5) ... 24.06/14.00 [2019-03-28 11:55:40,024 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c9c2536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:55:40, skipping insertion in model container 24.06/14.00 [2019-03-28 11:55:40,024 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.06/14.00 [2019-03-28 11:55:40,024 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 11:55:34" (4/5) ... 24.06/14.00 [2019-03-28 11:55:40,024 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c9c2536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:55:40, skipping insertion in model container 24.06/14.00 [2019-03-28 11:55:40,024 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 24.06/14.00 [2019-03-28 11:55:40,025 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 11:55:40" (5/5) ... 24.06/14.00 [2019-03-28 11:55:40,026 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 24.06/14.00 [2019-03-28 11:55:40,048 INFO L133 ementStrategyFactory]: Using default assertion order modulation 24.06/14.00 [2019-03-28 11:55:40,048 INFO L374 BuchiCegarLoop]: Interprodecural is true 24.06/14.00 [2019-03-28 11:55:40,048 INFO L375 BuchiCegarLoop]: Hoare is true 24.06/14.00 [2019-03-28 11:55:40,048 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 24.06/14.00 [2019-03-28 11:55:40,048 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 24.06/14.00 [2019-03-28 11:55:40,048 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 24.06/14.00 [2019-03-28 11:55:40,048 INFO L379 BuchiCegarLoop]: Difference is false 24.06/14.00 [2019-03-28 11:55:40,049 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 24.06/14.00 [2019-03-28 11:55:40,049 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 24.06/14.00 [2019-03-28 11:55:40,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. 24.06/14.00 [2019-03-28 11:55:40,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.06/14.00 [2019-03-28 11:55:40,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.06/14.00 [2019-03-28 11:55:40,057 INFO L119 BuchiIsEmpty]: Starting construction of run 24.06/14.00 [2019-03-28 11:55:40,061 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,061 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,062 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 24.06/14.00 [2019-03-28 11:55:40,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. 24.06/14.00 [2019-03-28 11:55:40,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.06/14.00 [2019-03-28 11:55:40,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.06/14.00 [2019-03-28 11:55:40,063 INFO L119 BuchiIsEmpty]: Starting construction of run 24.06/14.00 [2019-03-28 11:55:40,063 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,064 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,069 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 17#L12true [75] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 11#L12-2true [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 6#L16true [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 12#L29-8true 24.06/14.00 [2019-03-28 11:55:40,070 INFO L796 eck$LassoCheckResult]: Loop: 12#L29-8true [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 9#L29-1true [116] L29-1-->L29-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short4_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 8#L29-2true [65] L29-2-->L29-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short4_5|) InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} AuxVars[] AssignedVars[] 18#L29-6true [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 12#L29-8true 24.06/14.00 [2019-03-28 11:55:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,070 INFO L82 PathProgramCache]: Analyzing trace with hash 5050503, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:40,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,102 INFO L82 PathProgramCache]: Analyzing trace with hash 3182042, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:40,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:40,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/14.00 [2019-03-28 11:55:40,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 24.06/14.00 [2019-03-28 11:55:40,112 INFO L811 eck$LassoCheckResult]: loop already infeasible 24.06/14.00 [2019-03-28 11:55:40,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.06/14.00 [2019-03-28 11:55:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/14.00 [2019-03-28 11:55:40,113 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. 24.06/14.00 [2019-03-28 11:55:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:40,188 INFO L93 Difference]: Finished difference Result 21 states and 42 transitions. 24.06/14.00 [2019-03-28 11:55:40,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.06/14.00 [2019-03-28 11:55:40,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 42 transitions. 24.06/14.00 [2019-03-28 11:55:40,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 24.06/14.00 [2019-03-28 11:55:40,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 12 states and 25 transitions. 24.06/14.00 [2019-03-28 11:55:40,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 24.06/14.00 [2019-03-28 11:55:40,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 24.06/14.00 [2019-03-28 11:55:40,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 25 transitions. 24.06/14.00 [2019-03-28 11:55:40,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.06/14.00 [2019-03-28 11:55:40,195 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 25 transitions. 24.06/14.00 [2019-03-28 11:55:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 25 transitions. 24.06/14.00 [2019-03-28 11:55:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. 24.06/14.00 [2019-03-28 11:55:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. 24.06/14.00 [2019-03-28 11:55:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. 24.06/14.00 [2019-03-28 11:55:40,198 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 24.06/14.00 [2019-03-28 11:55:40,198 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 24 transitions. 24.06/14.00 [2019-03-28 11:55:40,198 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 24.06/14.00 [2019-03-28 11:55:40,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 24 transitions. 24.06/14.00 [2019-03-28 11:55:40,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 24.06/14.00 [2019-03-28 11:55:40,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.06/14.00 [2019-03-28 11:55:40,199 INFO L119 BuchiIsEmpty]: Starting construction of run 24.06/14.00 [2019-03-28 11:55:40,199 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,199 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,200 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 56#L12 [75] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 51#L12-2 [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 52#L16 [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 53#L29-8 24.06/14.00 [2019-03-28 11:55:40,201 INFO L796 eck$LassoCheckResult]: Loop: 53#L29-8 [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 54#L29-1 [117] L29-1-->L29-2: Formula: (and (= 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|) (not |v_ULTIMATE.start_cstrchr_#t~short4_2|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 58#L29-2 [65] L29-2-->L29-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short4_5|) InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_5|} AuxVars[] AssignedVars[] 59#L29-6 [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 53#L29-8 24.06/14.00 [2019-03-28 11:55:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 5050503, now seen corresponding path program 2 times 24.06/14.00 [2019-03-28 11:55:40,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash 3183003, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:40,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:40,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/14.00 [2019-03-28 11:55:40,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 24.06/14.00 [2019-03-28 11:55:40,224 INFO L811 eck$LassoCheckResult]: loop already infeasible 24.06/14.00 [2019-03-28 11:55:40,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 24.06/14.00 [2019-03-28 11:55:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 24.06/14.00 [2019-03-28 11:55:40,225 INFO L87 Difference]: Start difference. First operand 11 states and 24 transitions. cyclomatic complexity: 14 Second operand 3 states. 24.06/14.00 [2019-03-28 11:55:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:40,256 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. 24.06/14.00 [2019-03-28 11:55:40,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 24.06/14.00 [2019-03-28 11:55:40,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 23 transitions. 24.06/14.00 [2019-03-28 11:55:40,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.06/14.00 [2019-03-28 11:55:40,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 24.06/14.00 [2019-03-28 11:55:40,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 24.06/14.00 [2019-03-28 11:55:40,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.06/14.00 [2019-03-28 11:55:40,258 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 24.06/14.00 [2019-03-28 11:55:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 24.06/14.00 [2019-03-28 11:55:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,260 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,260 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,260 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 24.06/14.00 [2019-03-28 11:55:40,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 19 transitions. 24.06/14.00 [2019-03-28 11:55:40,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.06/14.00 [2019-03-28 11:55:40,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.06/14.00 [2019-03-28 11:55:40,261 INFO L119 BuchiIsEmpty]: Starting construction of run 24.06/14.00 [2019-03-28 11:55:40,262 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,262 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,262 INFO L794 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 85#L12 [75] L12-->L12-2: Formula: (and (< v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5 1) (= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4 1)) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_5} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_~length~0] 78#L12-2 [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 79#L16 [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 82#L29-8 24.06/14.00 [2019-03-28 11:55:40,263 INFO L796 eck$LassoCheckResult]: Loop: 82#L29-8 [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 83#L29-1 [116] L29-1-->L29-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short4_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 86#L29-2 [64] L29-2-->L29-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short4_3| InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} AuxVars[] AssignedVars[] 80#L29-3 [58] L29-3-->L29-4: Formula: (and (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem3_2|) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_2|, ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem3] 81#L29-4 [129] L29-4-->L29-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and (> .cse0 |v_ULTIMATE.start_cstrchr_#t~mem3_3|) |v_ULTIMATE.start_cstrchr_#t~short4_4| (<= .cse0 127))) InVars {ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 87#L29-6 [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 82#L29-8 24.06/14.00 [2019-03-28 11:55:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash 5050503, now seen corresponding path program 3 times 24.06/14.00 [2019-03-28 11:55:40,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1237069868, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:40,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1660427302, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:40,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:40,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:40,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 24.06/14.00 [2019-03-28 11:55:40,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 24.06/14.00 [2019-03-28 11:55:40,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 24.06/14.00 [2019-03-28 11:55:40,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 24.06/14.00 [2019-03-28 11:55:40,401 INFO L87 Difference]: Start difference. First operand 10 states and 19 transitions. cyclomatic complexity: 10 Second operand 6 states. 24.06/14.00 [2019-03-28 11:55:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 24.06/14.00 [2019-03-28 11:55:40,472 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. 24.06/14.00 [2019-03-28 11:55:40,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 24.06/14.00 [2019-03-28 11:55:40,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 23 transitions. 24.06/14.00 [2019-03-28 11:55:40,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.06/14.00 [2019-03-28 11:55:40,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 24.06/14.00 [2019-03-28 11:55:40,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 24.06/14.00 [2019-03-28 11:55:40,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.06/14.00 [2019-03-28 11:55:40,475 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. 24.06/14.00 [2019-03-28 11:55:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 24.06/14.00 [2019-03-28 11:55:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,476 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,476 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,476 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 24.06/14.00 [2019-03-28 11:55:40,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 18 transitions. 24.06/14.00 [2019-03-28 11:55:40,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 24.06/14.00 [2019-03-28 11:55:40,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 24.06/14.00 [2019-03-28 11:55:40,477 INFO L119 BuchiIsEmpty]: Starting construction of run 24.06/14.00 [2019-03-28 11:55:40,477 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,477 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 24.06/14.00 [2019-03-28 11:55:40,478 INFO L794 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L12: Formula: (and (= |v_#valid_13| (store |v_#valid_14| 0 0)) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_14|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_4|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret10.base=|v_ULTIMATE.start_main_#t~ret10.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret10.offset=|v_ULTIMATE.start_main_#t~ret10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet9, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret10.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret8.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret10.offset] 124#L12 [89] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 119#L12-2 [103] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 120#L16 [138] L16-->L29-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret8.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet9_5|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= .cse0 (select |v_#length_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| |v_ULTIMATE.start_main_#t~ret8.offset_5|) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_9| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0))) (= |v_ULTIMATE.start_main_#t~ret8.base_5| |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= 1 (select |v_#valid_16| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_12|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite7.offset=|v_ULTIMATE.start_cstrchr_#t~ite7.offset_6|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_4|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_5|, ULTIMATE.start_cstrchr_#t~ite7.base=|v_ULTIMATE.start_cstrchr_#t~ite7.base_6|, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_6|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_6|, ULTIMATE.start_cstrchr_#t~mem6=|v_ULTIMATE.start_cstrchr_#t~mem6_6|, #length=|v_#length_12|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_main_#t~ret8.base=|v_ULTIMATE.start_main_#t~ret8.base_5|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_10|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_4|, ULTIMATE.start_main_#t~ret8.offset=|v_ULTIMATE.start_main_#t~ret8.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret8.base, ULTIMATE.start_cstrchr_#t~ite7.offset, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_#t~ite7.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~mem6, #memory_int, ULTIMATE.start_cstrchr_~c, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~post5.offset, ULTIMATE.start_main_#t~ret8.offset] 121#L29-8 24.06/14.00 [2019-03-28 11:55:40,478 INFO L796 eck$LassoCheckResult]: Loop: 121#L29-8 [72] L29-8-->L29-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3) 1) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem2_2|)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem2] 122#L29-1 [116] L29-1-->L29-2: Formula: (and |v_ULTIMATE.start_cstrchr_#t~short4_2| (< 0 |v_ULTIMATE.start_cstrchr_#t~mem2_3|)) InVars {ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_2|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 125#L29-2 [64] L29-2-->L29-3: Formula: |v_ULTIMATE.start_cstrchr_#t~short4_3| InVars {ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} OutVars{ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_3|} AuxVars[] AssignedVars[] 117#L29-3 [58] L29-3-->L29-4: Formula: (and (= (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrchr_~s.base_6) v_ULTIMATE.start_cstrchr_~s.offset_5) |v_ULTIMATE.start_cstrchr_#t~mem3_2|) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrchr_~s.base_6)) (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_5) (= (select |v_#valid_9| v_ULTIMATE.start_cstrchr_~s.base_6) 1)) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_2|, ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_5, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_6, #length=|v_#length_7|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem3] 118#L29-4 [129] L29-4-->L29-6: Formula: (let ((.cse0 (mod v_ULTIMATE.start_cstrchr_~c_3 256))) (and (> .cse0 |v_ULTIMATE.start_cstrchr_#t~mem3_3|) |v_ULTIMATE.start_cstrchr_#t~short4_4| (<= .cse0 127))) InVars {ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} OutVars{ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_3|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_4|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short4] 126#L29-6 [78] L29-6-->L29-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short4_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem3=|v_ULTIMATE.start_cstrchr_#t~mem3_5|, ULTIMATE.start_cstrchr_#t~mem2=|v_ULTIMATE.start_cstrchr_#t~mem2_5|, ULTIMATE.start_cstrchr_#t~short4=|v_ULTIMATE.start_cstrchr_#t~short4_8|, ULTIMATE.start_cstrchr_#t~post5.base=|v_ULTIMATE.start_cstrchr_#t~post5.base_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~post5.offset=|v_ULTIMATE.start_cstrchr_#t~post5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem3, ULTIMATE.start_cstrchr_#t~mem2, ULTIMATE.start_cstrchr_#t~short4, ULTIMATE.start_cstrchr_#t~post5.base, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~post5.offset] 121#L29-8 24.06/14.00 [2019-03-28 11:55:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,479 INFO L82 PathProgramCache]: Analyzing trace with hash 5063957, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:40,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1237069868, now seen corresponding path program 2 times 24.06/14.00 [2019-03-28 11:55:40,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1194986008, now seen corresponding path program 1 times 24.06/14.00 [2019-03-28 11:55:40,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 24.06/14.00 [2019-03-28 11:55:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 24.06/14.00 [2019-03-28 11:55:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 24.06/14.00 [2019-03-28 11:55:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 24.06/14.00 [2019-03-28 11:55:40,701 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 24.06/14.00 [2019-03-28 11:55:40,767 INFO L216 LassoAnalysis]: Preferences: 24.06/14.00 [2019-03-28 11:55:40,768 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 24.06/14.00 [2019-03-28 11:55:40,768 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 24.06/14.00 [2019-03-28 11:55:40,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 24.06/14.00 [2019-03-28 11:55:40,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false 24.06/14.00 [2019-03-28 11:55:40,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 24.06/14.00 [2019-03-28 11:55:40,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 24.06/14.00 [2019-03-28 11:55:40,769 INFO L130 ssoRankerPreferences]: Path of dumped script: 24.06/14.00 [2019-03-28 11:55:40,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso 24.06/14.00 [2019-03-28 11:55:40,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 24.06/14.00 [2019-03-28 11:55:40,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 24.06/14.00 [2019-03-28 11:55:40,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:40,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 24.06/14.00 [2019-03-28 11:55:41,261 INFO L300 LassoAnalysis]: Preprocessing complete. 24.06/14.00 [2019-03-28 11:55:41,267 INFO L497 LassoAnalysis]: Using template 'affine'. 24.06/14.00 [2019-03-28 11:55:41,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.06/14.00 [2019-03-28 11:55:41,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.06/14.00 [2019-03-28 11:55:41,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.06/14.00 [2019-03-28 11:55:41,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.06/14.00 [2019-03-28 11:55:41,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.06/14.00 [2019-03-28 11:55:41,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 24.06/14.00 [2019-03-28 11:55:41,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 24.06/14.00 [2019-03-28 11:55:41,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 24.06/14.00 Termination analysis: LINEAR_WITH_GUESSES 24.06/14.00 Number of strict supporting invariants: 0 24.06/14.00 Number of non-strict supporting invariants: 1 24.06/14.00 Consider only non-deceasing supporting invariants: true 24.06/14.00 Simplify termination arguments: true 24.06/14.00 Simplify supporting invariants: trueOverapproximate stem: false 24.06/14.00 [2019-03-28 11:55:41,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. 24.06/14.00 [2019-03-28 11:55:41,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 24.06/14.00 [2019-03-28 11:55:41,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 24.06/14.00 [2019-03-28 11:55:41,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 24.06/14.00 [2019-03-28 11:55:41,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 24.06/14.00 [2019-03-28 11:55:41,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 24.06/14.00 [2019-03-28 11:55:41,342 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 24.06/14.00 [2019-03-28 11:55:41,365 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 24.06/14.00 [2019-03-28 11:55:41,366 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. 24.06/14.00 [2019-03-28 11:55:41,368 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 24.06/14.00 [2019-03-28 11:55:41,369 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 24.06/14.00 [2019-03-28 11:55:41,370 INFO L518 LassoAnalysis]: Proved termination. 24.06/14.00 [2019-03-28 11:55:41,370 INFO L520 LassoAnalysis]: Termination argument consisting of: 24.06/14.00 Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1 24.06/14.00 Supporting invariants [] 24.06/14.00 [2019-03-28 11:55:41,381 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed 24.06/14.00 [2019-03-28 11:55:41,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 24.06/14.00 [2019-03-28 11:55:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:41,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core 24.06/14.00 [2019-03-28 11:55:41,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.06/14.00 [2019-03-28 11:55:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:41,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 24.06/14.00 [2019-03-28 11:55:41,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.06/14.00 [2019-03-28 11:55:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 24.06/14.00 [2019-03-28 11:55:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 24.06/14.00 [2019-03-28 11:55:41,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core 24.06/14.00 [2019-03-28 11:55:41,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... 24.06/14.00 [2019-03-28 11:55:41,567 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 24.06/14.00 [2019-03-28 11:55:41,571 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 24.06/14.00 [2019-03-28 11:55:41,572 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9 Second operand 4 states. 24.06/14.00 [2019-03-28 11:55:41,658 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 10 states and 18 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 16 states and 32 transitions. Complement of second has 5 states. 24.06/14.00 [2019-03-28 11:55:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states 24.06/14.00 [2019-03-28 11:55:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 24.06/14.00 [2019-03-28 11:55:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. 24.06/14.00 [2019-03-28 11:55:41,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 6 letters. 24.06/14.00 [2019-03-28 11:55:41,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.06/14.00 [2019-03-28 11:55:41,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 10 letters. Loop has 6 letters. 24.06/14.00 [2019-03-28 11:55:41,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.06/14.00 [2019-03-28 11:55:41,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 4 letters. Loop has 12 letters. 24.06/14.00 [2019-03-28 11:55:41,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. 24.06/14.00 [2019-03-28 11:55:41,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 32 transitions. 24.06/14.00 [2019-03-28 11:55:41,668 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.06/14.00 [2019-03-28 11:55:41,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:41,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 24.06/14.00 [2019-03-28 11:55:41,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 24.06/14.00 [2019-03-28 11:55:41,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:41,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 24.06/14.00 [2019-03-28 11:55:41,669 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:41,669 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:41,669 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:41,669 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 24.06/14.00 [2019-03-28 11:55:41,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 24.06/14.00 [2019-03-28 11:55:41,669 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 24.06/14.00 [2019-03-28 11:55:41,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 24.06/14.00 [2019-03-28 11:55:41,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 11:55:41 BasicIcfg 24.06/14.00 [2019-03-28 11:55:41,675 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 24.06/14.00 [2019-03-28 11:55:41,676 INFO L168 Benchmark]: Toolchain (without parser) took 8059.01 ms. Allocated memory was 649.6 MB in the beginning and 758.1 MB in the end (delta: 108.5 MB). Free memory was 559.8 MB in the beginning and 446.9 MB in the end (delta: 112.9 MB). Peak memory consumption was 221.5 MB. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,677 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.32 ms. Allocated memory was 649.6 MB in the beginning and 664.8 MB in the end (delta: 15.2 MB). Free memory was 558.5 MB in the beginning and 632.1 MB in the end (delta: -73.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.31 ms. Allocated memory is still 664.8 MB. Free memory was 632.1 MB in the beginning and 629.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,678 INFO L168 Benchmark]: Boogie Preprocessor took 24.93 ms. Allocated memory is still 664.8 MB. Free memory was 629.0 MB in the beginning and 626.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,679 INFO L168 Benchmark]: RCFGBuilder took 277.03 ms. Allocated memory is still 664.8 MB. Free memory was 626.3 MB in the beginning and 606.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,679 INFO L168 Benchmark]: BlockEncodingV2 took 119.34 ms. Allocated memory is still 664.8 MB. Free memory was 606.3 MB in the beginning and 598.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,680 INFO L168 Benchmark]: TraceAbstraction took 5632.57 ms. Allocated memory was 664.8 MB in the beginning and 739.2 MB in the end (delta: 74.4 MB). Free memory was 596.8 MB in the beginning and 387.0 MB in the end (delta: 209.8 MB). Peak memory consumption was 284.2 MB. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,680 INFO L168 Benchmark]: BuchiAutomizer took 1658.19 ms. Allocated memory was 739.2 MB in the beginning and 758.1 MB in the end (delta: 18.9 MB). Free memory was 387.0 MB in the beginning and 446.9 MB in the end (delta: -59.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 24.06/14.00 [2019-03-28 11:55:41,684 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 24.06/14.00 --- Results --- 24.06/14.00 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 24.06/14.00 - StatisticsResult: Initial Icfg 24.06/14.00 28 locations, 32 edges 24.06/14.00 - StatisticsResult: Encoded RCFG 24.06/14.00 19 locations, 42 edges 24.06/14.00 * Results from de.uni_freiburg.informatik.ultimate.core: 24.06/14.00 - StatisticsResult: Toolchain Benchmarks 24.06/14.00 Benchmark results are: 24.06/14.00 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 24.06/14.00 * CACSL2BoogieTranslator took 300.32 ms. Allocated memory was 649.6 MB in the beginning and 664.8 MB in the end (delta: 15.2 MB). Free memory was 558.5 MB in the beginning and 632.1 MB in the end (delta: -73.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. 24.06/14.00 * Boogie Procedure Inliner took 41.31 ms. Allocated memory is still 664.8 MB. Free memory was 632.1 MB in the beginning and 629.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 24.06/14.00 * Boogie Preprocessor took 24.93 ms. Allocated memory is still 664.8 MB. Free memory was 629.0 MB in the beginning and 626.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 24.06/14.00 * RCFGBuilder took 277.03 ms. Allocated memory is still 664.8 MB. Free memory was 626.3 MB in the beginning and 606.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 50.3 GB. 24.06/14.00 * BlockEncodingV2 took 119.34 ms. Allocated memory is still 664.8 MB. Free memory was 606.3 MB in the beginning and 598.2 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. 24.06/14.00 * TraceAbstraction took 5632.57 ms. Allocated memory was 664.8 MB in the beginning and 739.2 MB in the end (delta: 74.4 MB). Free memory was 596.8 MB in the beginning and 387.0 MB in the end (delta: 209.8 MB). Peak memory consumption was 284.2 MB. Max. memory is 50.3 GB. 24.06/14.00 * BuchiAutomizer took 1658.19 ms. Allocated memory was 739.2 MB in the beginning and 758.1 MB in the end (delta: 18.9 MB). Free memory was 387.0 MB in the beginning and 446.9 MB in the end (delta: -59.9 MB). There was no memory consumed. Max. memory is 50.3 GB. 24.06/14.00 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #memory_int 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #memory_int 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #memory_int 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #memory_int 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #memory_int 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #memory_int 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 - GenericResult: Unfinished Backtranslation 24.06/14.00 unknown boogie variable #length 24.06/14.00 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 24.06/14.00 - PositiveResult [Line: 16]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - PositiveResult [Line: 29]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - PositiveResult [Line: 31]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - PositiveResult [Line: 16]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - PositiveResult [Line: 29]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - PositiveResult [Line: 31]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - PositiveResult [Line: 29]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - PositiveResult [Line: 29]: pointer dereference always succeeds 24.06/14.00 For all program executions holds that pointer dereference always succeeds at this location 24.06/14.00 - AllSpecificationsHoldResult: All specifications hold 24.06/14.00 8 specifications checked. All of them hold 24.06/14.00 - InvariantResult [Line: 29]: Loop Invariant 24.06/14.00 [2019-03-28 11:55:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:41,697 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:41,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:41,699 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~length~0,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] 24.06/14.00 [2019-03-28 11:55:41,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:41,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:41,703 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 24.06/14.00 [2019-03-28 11:55:41,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 Derived loop invariant: (((((((1 == \valid[s] && 1 <= length) && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~length~0 : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: ((unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~length~0 + ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + -1] == 0 && 1 <= ULTIMATE.start___VERIFIER_nondet_String_~length~0) && ULTIMATE.start___VERIFIER_nondet_String_~length~0 + ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= unknown-#length-unknown[s]) && s <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && 0 == s) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s] + -1] == 0 && ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && \valid[nondetString] == 1) || (((((((1 <= s && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 1 <= length) && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (unknown-#memory_int-unknown[s][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s] + -1] == 0 && ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0) && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset)) && \valid[nondetString] == 1) 24.06/14.00 - InvariantResult [Line: 16]: Loop Invariant 24.06/14.00 [2019-03-28 11:55:41,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 [2019-03-28 11:55:41,706 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 24.06/14.00 Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 24.06/14.00 - StatisticsResult: Ultimate Automizer benchmark data 24.06/14.00 CFG has 1 procedures, 19 locations, 8 error locations. SAFE Result, 5.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 909 SDslu, 246 SDs, 0 SdLazy, 648 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 5 NumberOfFragments, 140 HoareAnnotationTreeSize, 2 FomulaSimplifications, 140 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 153 ConstructedInterpolants, 8 QuantifiedInterpolants, 19651 SizeOfPredicates, 32 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 18/64 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 24.06/14.00 - StatisticsResult: Constructed decomposition of program 24.06/14.00 Your program was decomposed into 4 terminating modules (3 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. 24.06/14.00 - StatisticsResult: Timing statistics 24.06/14.00 BüchiAutomizer plugin needed 1.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 77 SDslu, 87 SDs, 0 SdLazy, 202 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf100 lsp95 ukn90 mio100 lsp40 div120 bol100 ite100 ukn100 eq162 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 24.06/14.00 - TerminationAnalysisResult: Termination proven 24.06/14.00 Buchi Automizer proved that your program is terminating 24.06/14.00 RESULT: Ultimate proved your program to be correct! 24.06/14.00 !SESSION 2019-03-28 11:55:29.698 ----------------------------------------------- 24.06/14.00 eclipse.buildId=unknown 24.06/14.00 java.version=1.8.0_181 24.06/14.00 java.vendor=Oracle Corporation 24.06/14.00 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 24.06/14.00 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 24.06/14.00 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 24.06/14.00 24.06/14.00 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 11:55:41.932 24.06/14.00 !MESSAGE The workspace will exit with unsaved changes in this session. 24.06/14.00 Received shutdown request... 24.06/14.00 Ultimate: 24.06/14.00 GTK+ Version Check 24.06/14.00 EOF