./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:48:44,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:48:44,463 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:48:44,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:48:44,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:48:44,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:48:44,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:48:44,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:48:44,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:48:44,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:48:44,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:48:44,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:48:44,478 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:48:44,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:48:44,480 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:48:44,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:48:44,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:48:44,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:48:44,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:48:44,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:48:44,485 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:48:44,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:48:44,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:48:44,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:48:44,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:48:44,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:48:44,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:48:44,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:48:44,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:48:44,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:48:44,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:48:44,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:48:44,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:48:44,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:48:44,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:48:44,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:48:44,494 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:48:44,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:48:44,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:48:44,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:48:44,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:48:44,506 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:48:44,507 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:48:44,507 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:48:44,507 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:48:44,507 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:48:44,507 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:48:44,507 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:48:44,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:48:44,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:48:44,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:48:44,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:48:44,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:48:44,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:48:44,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:48:44,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:48:44,509 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:48:44,509 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:48:44,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:48:44,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:48:44,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:48:44,509 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:48:44,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:48:44,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:48:44,510 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:48:44,510 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:48:44,511 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2018-11-18 12:48:44,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:48:44,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:48:44,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:48:44,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:48:44,543 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:48:44,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 12:48:44,582 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/data/13e2ae42d/ced60e7be8e04194a07a5e344bf129c5/FLAGb38e0e1c7 [2018-11-18 12:48:44,885 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:48:44,885 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/sv-benchmarks/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 12:48:44,889 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/data/13e2ae42d/ced60e7be8e04194a07a5e344bf129c5/FLAGb38e0e1c7 [2018-11-18 12:48:44,898 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/data/13e2ae42d/ced60e7be8e04194a07a5e344bf129c5 [2018-11-18 12:48:44,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:48:44,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:48:44,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:48:44,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:48:44,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:48:44,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:48:44" (1/1) ... [2018-11-18 12:48:44,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fe5536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:44, skipping insertion in model container [2018-11-18 12:48:44,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:48:44" (1/1) ... [2018-11-18 12:48:44,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:48:44,927 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:48:45,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:48:45,037 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:48:45,047 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:48:45,056 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:48:45,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45 WrapperNode [2018-11-18 12:48:45,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:48:45,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:48:45,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:48:45,057 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:48:45,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:48:45,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:48:45,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:48:45,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:48:45,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... [2018-11-18 12:48:45,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:48:45,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:48:45,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:48:45,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:48:45,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:48:45,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:48:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:48:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:48:45,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:48:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:48:45,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:48:45,342 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:48:45,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:48:45 BoogieIcfgContainer [2018-11-18 12:48:45,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:48:45,344 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:48:45,344 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:48:45,347 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:48:45,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:48:45,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:48:44" (1/3) ... [2018-11-18 12:48:45,350 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27761037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:48:45, skipping insertion in model container [2018-11-18 12:48:45,350 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:48:45,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:48:45" (2/3) ... [2018-11-18 12:48:45,350 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27761037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:48:45, skipping insertion in model container [2018-11-18 12:48:45,350 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:48:45,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:48:45" (3/3) ... [2018-11-18 12:48:45,352 INFO L375 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 12:48:45,404 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:48:45,404 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:48:45,404 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:48:45,405 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:48:45,405 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:48:45,405 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:48:45,405 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:48:45,405 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:48:45,405 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:48:45,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-18 12:48:45,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:48:45,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:45,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:45,444 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:48:45,444 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:48:45,444 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:48:45,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-18 12:48:45,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:48:45,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:45,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:45,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:48:45,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 12:48:45,452 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 7#L24-2true [2018-11-18 12:48:45,452 INFO L796 eck$LassoCheckResult]: Loop: 7#L24-2true assume true; 13#L15-1true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 10#L15-2true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 7#L24-2true [2018-11-18 12:48:45,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:48:45,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:45,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:45,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:45,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:45,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1110374, now seen corresponding path program 1 times [2018-11-18 12:48:45,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:45,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:45,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash 889537576, now seen corresponding path program 1 times [2018-11-18 12:48:45,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:45,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:45,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:46,091 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-11-18 12:48:46,245 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-18 12:48:46,254 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:48:46,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:48:46,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:48:46,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:48:46,256 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:48:46,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:48:46,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:48:46,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:48:46,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Lasso [2018-11-18 12:48:46,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:48:46,256 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:48:46,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,620 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2018-11-18 12:48:46,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:46,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:47,068 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:48:47,072 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:48:47,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:48:47,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:48:47,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:48:47,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:48:47,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:48:47,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:48:47,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:48:47,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:48:47,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:48:47,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,118 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:48:47,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,120 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:48:47,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,192 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:48:47,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,195 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:48:47,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,237 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:48:47,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,239 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:48:47,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:47,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:47,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:47,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:47,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:47,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:47,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:47,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:47,257 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:48:47,262 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:48:47,262 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:48:47,264 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:48:47,265 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:48:47,266 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:48:47,266 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2018-11-18 12:48:47,424 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-18 12:48:47,430 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:48:47,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:47,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:47,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:47,498 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 12:48:47,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-11-18 12:48:47,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 32 states and 39 transitions. Complement of second has 8 states. [2018-11-18 12:48:47,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:48:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 12:48:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-18 12:48:47,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-18 12:48:47,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:47,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 12:48:47,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:47,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 12:48:47,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:47,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2018-11-18 12:48:47,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:48:47,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 16 states and 21 transitions. [2018-11-18 12:48:47,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 12:48:47,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 12:48:47,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2018-11-18 12:48:47,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:47,550 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 12:48:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2018-11-18 12:48:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 12:48:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 12:48:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2018-11-18 12:48:47,569 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 12:48:47,569 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2018-11-18 12:48:47,569 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:48:47,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2018-11-18 12:48:47,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:48:47,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:47,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:47,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:48:47,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:48:47,571 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 251#L24-2 assume true; 260#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 261#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 252#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 253#L20 [2018-11-18 12:48:47,571 INFO L796 eck$LassoCheckResult]: Loop: 253#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 257#L24-2 assume true; 258#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 265#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 264#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 253#L20 [2018-11-18 12:48:47,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:47,571 INFO L82 PathProgramCache]: Analyzing trace with hash 889537578, now seen corresponding path program 1 times [2018-11-18 12:48:47,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:47,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:47,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:47,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:47,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:48:47,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:48:47,702 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:48:47,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash 48209947, now seen corresponding path program 1 times [2018-11-18 12:48:47,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:47,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:48:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:48:47,776 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 5 states. [2018-11-18 12:48:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:48:47,833 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-18 12:48:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:48:47,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-18 12:48:47,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:48:47,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 23 transitions. [2018-11-18 12:48:47,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 12:48:47,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 12:48:47,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-18 12:48:47,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:47,835 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 12:48:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-18 12:48:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-11-18 12:48:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 12:48:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-18 12:48:47,837 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 12:48:47,837 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-18 12:48:47,837 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:48:47,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-18 12:48:47,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:48:47,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:47,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:47,838 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-18 12:48:47,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:48:47,838 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 301#L24-2 assume true; 307#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 310#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 304#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 305#L24-2 assume true; 308#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 309#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 302#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 303#L20 [2018-11-18 12:48:47,838 INFO L796 eck$LassoCheckResult]: Loop: 303#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 312#L24-2 assume true; 313#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 315#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 314#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 303#L20 [2018-11-18 12:48:47,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash -352728561, now seen corresponding path program 1 times [2018-11-18 12:48:47,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:47,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 48209947, now seen corresponding path program 2 times [2018-11-18 12:48:47,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:47,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:47,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:47,872 INFO L82 PathProgramCache]: Analyzing trace with hash -698880307, now seen corresponding path program 1 times [2018-11-18 12:48:47,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:47,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:47,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:48:47,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:48:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:47,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:48,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:48,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:48:48,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:48,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:48,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:48:48,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-11-18 12:48:48,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:48:48,104 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:48,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-18 12:48:48,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:48,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 12:48:48,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:48:48,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2018-11-18 12:48:48,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 12:48:48,164 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:48,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,172 INFO L267 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. [2018-11-18 12:48:48,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2018-11-18 12:48:48,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 12:48:48,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 12:48:48,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 12:48:48,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:48,207 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-18 12:48:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:48:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-18 12:48:48,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:48:48,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:48:48,290 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 11 states. [2018-11-18 12:48:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:48:48,397 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-18 12:48:48,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 12:48:48,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 30 transitions. [2018-11-18 12:48:48,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:48:48,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 24 states and 27 transitions. [2018-11-18 12:48:48,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-18 12:48:48,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 12:48:48,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-18 12:48:48,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:48:48,400 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-18 12:48:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-18 12:48:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-11-18 12:48:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 12:48:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-18 12:48:48,402 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 12:48:48,402 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 12:48:48,402 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:48:48,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-18 12:48:48,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:48:48,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:48,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:48,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:48:48,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2018-11-18 12:48:48,403 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 408#L24-2 [2018-11-18 12:48:48,403 INFO L796 eck$LassoCheckResult]: Loop: 408#L24-2 assume true; 419#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 413#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 409#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 410#L24-2 assume true; 412#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 416#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 418#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 417#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 408#L24-2 [2018-11-18 12:48:48,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 12:48:48,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:48,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:48,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:48,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:48,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2017747304, now seen corresponding path program 1 times [2018-11-18 12:48:48,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:48,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:48,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:48,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:48,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1950316518, now seen corresponding path program 2 times [2018-11-18 12:48:48,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:48,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:48,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:48,821 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-18 12:48:48,940 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-18 12:48:48,943 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:48:48,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:48:48,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:48:48,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:48:48,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:48:48,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:48:48,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:48:48,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:48:48,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2018-11-18 12:48:48,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:48:48,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:48:48,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:48,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,198 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2018-11-18 12:48:49,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:49,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:48:49,645 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:48:49,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:49,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:49,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:48:49,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:49,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:49,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:49,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:48:49,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:48:49,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:49,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:49,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:49,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:49,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:49,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:49,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:49,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:49,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:49,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:49,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:49,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:49,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:49,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:49,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:49,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:49,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:49,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:49,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:49,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:49,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:49,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:49,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:49,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:49,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:49,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:49,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:49,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:49,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:49,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:49,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:49,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:49,671 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:48:49,674 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:48:49,674 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:48:49,675 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:48:49,675 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:48:49,676 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:48:49,676 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2018-11-18 12:48:49,778 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 12:48:49,779 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:48:49,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:49,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:49,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:49,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:49,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-11-18 12:48:49,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-18 12:48:49,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:49,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:49,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2018-11-18 12:48:49,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 12:48:49,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:48:49,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:48:49,896 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-11-18 12:48:49,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:49,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-18 12:48:49,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:48:49,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:49,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:49,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:49,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:48:49,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-18 12:48:49,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:49,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:49,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:49,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-11-18 12:48:50,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:48:50,000 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,005 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-18 12:48:50,019 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-11-18 12:48:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:50,048 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 12:48:50,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-18 12:48:50,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 34 states and 39 transitions. Complement of second has 13 states. [2018-11-18 12:48:50,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 12:48:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:48:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-11-18 12:48:50,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 11 transitions. Stem has 2 letters. Loop has 9 letters. [2018-11-18 12:48:50,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:50,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 11 transitions. Stem has 11 letters. Loop has 9 letters. [2018-11-18 12:48:50,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:50,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 11 transitions. Stem has 2 letters. Loop has 18 letters. [2018-11-18 12:48:50,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:50,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-18 12:48:50,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:48:50,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 39 transitions. [2018-11-18 12:48:50,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 12:48:50,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-18 12:48:50,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 39 transitions. [2018-11-18 12:48:50,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:50,142 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 12:48:50,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 39 transitions. [2018-11-18 12:48:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-18 12:48:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:48:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-18 12:48:50,145 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 12:48:50,145 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 12:48:50,145 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:48:50,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2018-11-18 12:48:50,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:48:50,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:50,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:50,146 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 12:48:50,146 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:48:50,146 INFO L794 eck$LassoCheckResult]: Stem: 696#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 691#L24-2 assume true; 701#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 702#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 703#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 720#L24-2 assume true; 719#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 718#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 717#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 707#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 705#L24 [2018-11-18 12:48:50,146 INFO L796 eck$LassoCheckResult]: Loop: 705#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 697#L24-2 assume true; 698#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 706#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 714#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 713#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 705#L24 [2018-11-18 12:48:50,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:50,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1950316520, now seen corresponding path program 1 times [2018-11-18 12:48:50,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:50,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:50,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:50,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:50,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:50,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:48:50,296 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:48:50,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:50,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:50,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-18 12:48:50,374 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-11-18 12:48:50,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,400 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-18 12:48:50,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 68 [2018-11-18 12:48:50,451 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:50,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2018-11-18 12:48:50,463 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:50,463 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-18 12:48:50,478 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:50,478 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-11-18 12:48:50,495 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:50,495 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,504 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,508 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,521 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,526 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 12:48:50,537 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2018-11-18 12:48:50,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:50,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 65 [2018-11-18 12:48:50,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:48:50,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 12:48:50,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2018-11-18 12:48:50,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-11-18 12:48:50,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 12:48:50,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 12:48:50,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 12:48:50,666 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 12:48:50,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:50,678 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:76, output treesize:3 [2018-11-18 12:48:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:50,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:48:50,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-18 12:48:50,698 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:48:50,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1637654135, now seen corresponding path program 1 times [2018-11-18 12:48:50,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:50,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:50,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:50,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:50,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:50,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 12:48:50,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:48:50,801 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 7 Second operand 10 states. [2018-11-18 12:48:50,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:48:50,985 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-18 12:48:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:48:50,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2018-11-18 12:48:50,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:48:50,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 49 states and 54 transitions. [2018-11-18 12:48:50,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-18 12:48:50,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 12:48:50,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 54 transitions. [2018-11-18 12:48:50,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:50,988 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-18 12:48:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 54 transitions. [2018-11-18 12:48:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-11-18 12:48:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:48:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 12:48:50,991 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 12:48:50,991 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 12:48:50,991 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:48:50,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2018-11-18 12:48:50,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 12:48:50,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:50,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:50,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 1, 1, 1, 1] [2018-11-18 12:48:50,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:48:50,993 INFO L794 eck$LassoCheckResult]: Stem: 840#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 834#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 835#L24-2 assume true; 841#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 846#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 838#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 839#L24-2 assume true; 855#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 854#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 853#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 851#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 842#L24-2 assume true; 843#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 856#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 857#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 865#L24-2 assume true; 864#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 863#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 862#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 850#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 847#L24 [2018-11-18 12:48:50,993 INFO L796 eck$LassoCheckResult]: Loop: 847#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 848#L24-2 assume true; 860#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 859#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 858#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 852#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 847#L24 [2018-11-18 12:48:50,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash 70056741, now seen corresponding path program 1 times [2018-11-18 12:48:50,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:50,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:50,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:50,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:50,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1637654135, now seen corresponding path program 2 times [2018-11-18 12:48:51,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:51,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:51,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1052660069, now seen corresponding path program 1 times [2018-11-18 12:48:51,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:51,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:51,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 12:48:51,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:48:51,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:48:51,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:51,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:51,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:51,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 12:48:51,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:51,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:51,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 12:48:51,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-18 12:48:51,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:48:51,206 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:51,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-18 12:48:51,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 12:48:51,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 12:48:51,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-11-18 12:48:51,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:48:51,265 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:51,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-18 12:48:51,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 12:48:51,291 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:51,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,301 INFO L267 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. [2018-11-18 12:48:51,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-11-18 12:48:51,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 12:48:51,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 12:48:51,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 12:48:51,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:51,351 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2018-11-18 12:48:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 12:48:51,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:48:51,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-11-18 12:48:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 12:48:51,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-18 12:48:51,505 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 14 states. [2018-11-18 12:48:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:48:51,813 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-18 12:48:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 12:48:51,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2018-11-18 12:48:51,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-18 12:48:51,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2018-11-18 12:48:51,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-18 12:48:51,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-18 12:48:51,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2018-11-18 12:48:51,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:51,815 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-18 12:48:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2018-11-18 12:48:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2018-11-18 12:48:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 12:48:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-18 12:48:51,817 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-18 12:48:51,817 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-18 12:48:51,817 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:48:51,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2018-11-18 12:48:51,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-18 12:48:51,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:51,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:51,818 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 1, 1, 1, 1] [2018-11-18 12:48:51,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:48:51,818 INFO L794 eck$LassoCheckResult]: Stem: 1045#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1039#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1040#L24-2 assume true; 1049#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1057#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1043#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1044#L24-2 assume true; 1071#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1053#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1054#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1060#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1048#L24-2 assume true; 1050#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1072#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1073#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1078#L24-2 assume true; 1077#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1076#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1075#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1061#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1055#L24 [2018-11-18 12:48:51,818 INFO L796 eck$LassoCheckResult]: Loop: 1055#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 1046#L24-2 assume true; 1047#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1051#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1052#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1070#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1055#L24 [2018-11-18 12:48:51,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash 70056741, now seen corresponding path program 2 times [2018-11-18 12:48:51,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:51,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:51,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:51,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:51,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1694912437, now seen corresponding path program 1 times [2018-11-18 12:48:51,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:51,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:48:51,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 12:48:51,856 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:48:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 12:48:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 12:48:51,856 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 12:48:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:48:51,883 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-18 12:48:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 12:48:51,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 44 transitions. [2018-11-18 12:48:51,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-18 12:48:51,885 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 39 states and 41 transitions. [2018-11-18 12:48:51,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-18 12:48:51,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 12:48:51,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2018-11-18 12:48:51,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:51,885 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 12:48:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2018-11-18 12:48:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-18 12:48:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 12:48:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-18 12:48:51,887 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 12:48:51,887 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-18 12:48:51,887 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 12:48:51,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2018-11-18 12:48:51,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-18 12:48:51,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:51,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:51,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 1, 1, 1, 1] [2018-11-18 12:48:51,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 2, 2, 1, 1, 1] [2018-11-18 12:48:51,889 INFO L794 eck$LassoCheckResult]: Stem: 1135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1133#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1134#L24-2 assume true; 1143#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1146#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1138#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1139#L24-2 assume true; 1154#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1153#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1152#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1150#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1142#L24-2 assume true; 1144#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1171#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1170#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1169#L24-2 assume true; 1168#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1167#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1166#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1151#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1147#L24 [2018-11-18 12:48:51,889 INFO L796 eck$LassoCheckResult]: Loop: 1147#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1148#L24-2 assume true; 1163#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1162#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1161#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1160#L24-2 assume true; 1159#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1158#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1157#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1149#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1140#L24-2 assume true; 1141#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1145#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1136#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1137#L24-2 assume true; 1165#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1164#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1155#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1156#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1147#L24 [2018-11-18 12:48:51,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash 70056741, now seen corresponding path program 3 times [2018-11-18 12:48:51,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:51,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:51,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:51,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash 657393179, now seen corresponding path program 1 times [2018-11-18 12:48:51,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:51,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:51,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1150005129, now seen corresponding path program 2 times [2018-11-18 12:48:51,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:51,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:51,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:48:51,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:52,396 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 114 [2018-11-18 12:48:52,500 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-18 12:48:54,231 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 189 DAG size of output: 149 [2018-11-18 12:48:54,567 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-18 12:48:54,570 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:48:54,570 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:48:54,570 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:48:54,570 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:48:54,570 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:48:54,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:48:54,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:48:54,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:48:54,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Lasso [2018-11-18 12:48:54,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:48:54,570 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:48:54,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:54,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:54,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:54,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:54,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:54,933 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-11-18 12:48:55,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:55,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:48:55,311 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:48:55,312 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:48:55,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:48:55,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:48:55,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:48:55,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:48:55,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:48:55,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:48:55,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:48:55,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:48:55,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:48:55,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,318 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:48:55,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,319 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:48:55,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,325 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:48:55,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,326 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:48:55,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,329 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:48:55,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,330 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:48:55,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:48:55,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:48:55,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:48:55,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:48:55,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:48:55,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:48:55,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:48:55,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:48:55,368 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:48:55,372 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 12:48:55,373 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 12:48:55,373 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:48:55,374 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:48:55,374 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:48:55,374 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2018-11-18 12:48:55,490 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2018-11-18 12:48:55,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:55,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:48:55,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:48:55,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:48:55,531 INFO L477 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 8 treesize of output 7 [2018-11-18 12:48:55,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,535 INFO L267 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. [2018-11-18 12:48:55,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-18 12:48:55,556 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 42 [2018-11-18 12:48:55,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-11-18 12:48:55,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,578 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-18 12:48:55,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:48:55,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:55,598 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:62 [2018-11-18 12:48:55,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-18 12:48:55,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:48:55,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-18 12:48:55,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-18 12:48:55,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:55,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:72 [2018-11-18 12:48:55,763 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 64 [2018-11-18 12:48:55,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2018-11-18 12:48:55,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:55,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-18 12:48:55,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-18 12:48:55,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:55,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:55,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2018-11-18 12:48:55,948 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:55,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 12:48:56,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-18 12:48:56,011 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:43, output treesize:149 [2018-11-18 12:48:56,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:56,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2018-11-18 12:48:56,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 12:48:56,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2018-11-18 12:48:56,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-11-18 12:48:56,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,297 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-11-18 12:48:56,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-11-18 12:48:56,345 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:48:56,438 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:56,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-11-18 12:48:56,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-18 12:48:56,440 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2018-11-18 12:48:56,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-11-18 12:48:56,516 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2018-11-18 12:48:56,543 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,563 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:48:56,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-11-18 12:48:56,628 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:193, output treesize:297 [2018-11-18 12:48:56,777 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2018-11-18 12:48:56,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-11-18 12:48:56,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:48:56,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-11-18 12:48:56,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-18 12:48:56,861 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:56,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:56,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-11-18 12:48:56,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 12:48:56,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:56,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:48:56,990 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:57,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2018-11-18 12:48:57,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-18 12:48:57,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:57,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:57,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2018-11-18 12:48:57,048 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:57,072 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:48:57,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2018-11-18 12:48:57,124 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:216 [2018-11-18 12:48:57,294 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2018-11-18 12:48:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:48:57,295 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-18 12:48:57,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-18 12:48:57,787 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 41 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 58 states and 62 transitions. Complement of second has 22 states. [2018-11-18 12:48:57,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-18 12:48:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 12:48:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-11-18 12:48:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 29 transitions. Stem has 20 letters. Loop has 19 letters. [2018-11-18 12:48:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 29 transitions. Stem has 39 letters. Loop has 19 letters. [2018-11-18 12:48:57,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:57,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 29 transitions. Stem has 20 letters. Loop has 38 letters. [2018-11-18 12:48:57,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:48:57,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2018-11-18 12:48:57,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:48:57,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2018-11-18 12:48:57,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-18 12:48:57,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-18 12:48:57,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2018-11-18 12:48:57,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:48:57,791 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-18 12:48:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2018-11-18 12:48:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-11-18 12:48:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 12:48:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-18 12:48:57,793 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-18 12:48:57,793 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-18 12:48:57,793 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 12:48:57,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 53 transitions. [2018-11-18 12:48:57,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:48:57,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:48:57,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:48:57,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 12:48:57,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2018-11-18 12:48:57,794 INFO L794 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1573#L24-2 assume true; 1608#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1618#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1617#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1616#L24-2 assume true; 1614#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1612#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1610#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1609#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1607#L24-2 assume true; 1605#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1603#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1601#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1599#L24-2 assume true; 1597#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1595#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1593#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1591#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1584#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1585#L24-2 [2018-11-18 12:48:57,794 INFO L796 eck$LassoCheckResult]: Loop: 1585#L24-2 assume true; 1620#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1582#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1574#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1575#L24-2 assume true; 1579#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1587#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1619#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1588#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1585#L24-2 [2018-11-18 12:48:57,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:57,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2123208299, now seen corresponding path program 3 times [2018-11-18 12:48:57,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:57,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:57,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:57,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:57,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:57,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2017747304, now seen corresponding path program 2 times [2018-11-18 12:48:57,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:57,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:57,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:57,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:48:57,821 INFO L82 PathProgramCache]: Analyzing trace with hash -789741996, now seen corresponding path program 4 times [2018-11-18 12:48:57,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:48:57,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:48:57,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:57,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:48:57,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:48:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:48:57,979 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-18 12:49:00,162 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 194 DAG size of output: 150 [2018-11-18 12:49:00,519 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-18 12:49:00,521 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:49:00,521 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:49:00,521 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:49:00,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:49:00,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:49:00,521 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:49:00,521 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:49:00,521 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:49:00,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Lasso [2018-11-18 12:49:00,522 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:49:00,522 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:49:00,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:00,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:00,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:00,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:00,877 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-18 12:49:00,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:00,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:00,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:00,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:49:01,208 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:49:01,208 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:49:01,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:01,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:01,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:01,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:01,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:01,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:01,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:01,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:01,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:01,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:01,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:01,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:01,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:01,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:01,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:01,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:01,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:01,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:01,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:01,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:49:01,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:01,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:01,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:01,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:49:01,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:49:01,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:49:01,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:49:01,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:49:01,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:49:01,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:49:01,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:49:01,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:49:01,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:49:01,218 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:49:01,219 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:49:01,219 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:49:01,219 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:49:01,220 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:49:01,220 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:49:01,220 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2018-11-18 12:49:01,315 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-18 12:49:01,316 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:49:01,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:01,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:01,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:01,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:01,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2018-11-18 12:49:01,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2018-11-18 12:49:01,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 12:49:01,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:01,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-18 12:49:01,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:01,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:01,432 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2018-11-18 12:49:01,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:01,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 12:49:01,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-18 12:49:01,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,482 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:01,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-11-18 12:49:01,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:49:01,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:01,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-18 12:49:01,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:49:01,507 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,509 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-18 12:49:01,522 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2018-11-18 12:49:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:49:01,549 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 12:49:01,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 53 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-18 12:49:01,633 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 53 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 101 states and 107 transitions. Complement of second has 13 states. [2018-11-18 12:49:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-18 12:49:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:49:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-11-18 12:49:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 12:49:01,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-18 12:49:01,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:01,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-18 12:49:01,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:49:01,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 107 transitions. [2018-11-18 12:49:01,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:49:01,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 75 states and 79 transitions. [2018-11-18 12:49:01,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 12:49:01,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-18 12:49:01,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 79 transitions. [2018-11-18 12:49:01,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:49:01,639 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-18 12:49:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 79 transitions. [2018-11-18 12:49:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-11-18 12:49:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 12:49:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-18 12:49:01,643 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-18 12:49:01,643 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-18 12:49:01,643 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 12:49:01,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2018-11-18 12:49:01,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 12:49:01,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:49:01,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:49:01,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 4, 4, 2, 2, 2, 1, 1] [2018-11-18 12:49:01,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2018-11-18 12:49:01,644 INFO L794 eck$LassoCheckResult]: Stem: 2002#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.alloc(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1997#L24-2 assume true; 2003#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2035#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2034#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 2033#L24-2 assume true; 2032#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2031#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2030#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 2029#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 2028#L24-2 assume true; 2027#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2026#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1998#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1999#L24-2 assume true; 2024#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2022#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2020#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 2017#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 2009#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 2004#L24-2 assume true; 2005#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2008#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2000#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 2001#L24-2 assume true; 2062#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2061#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2060#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 2052#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 2051#L24-2 assume true; 2050#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2049#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2048#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 2047#L24-2 assume true; 2046#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2045#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2044#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 2018#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 2010#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 2011#L24-2 [2018-11-18 12:49:01,644 INFO L796 eck$LassoCheckResult]: Loop: 2011#L24-2 assume true; 2013#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2006#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2007#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 2025#L24-2 assume true; 2023#L15-1 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2021#L15-2 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 2019#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 2014#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 2011#L24-2 [2018-11-18 12:49:01,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:01,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1290420605, now seen corresponding path program 5 times [2018-11-18 12:49:01,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:01,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:01,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:01,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:49:01,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:49:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 62 proven. 32 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 12:49:01,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:49:01,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1897ff25-af54-42f2-83ce-d248322589f6/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:49:01,853 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 12:49:01,888 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-18 12:49:01,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 12:49:01,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:49:01,892 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-18 12:49:01,896 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:01,897 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:01,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 12:49:01,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:9 [2018-11-18 12:49:01,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:49:01,913 INFO L477 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 8 treesize of output 7 [2018-11-18 12:49:01,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-18 12:49:01,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 12:49:01,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 12:49:01,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-11-18 12:49:01,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:49:01,956 INFO L477 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 8 treesize of output 7 [2018-11-18 12:49:01,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:01,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-18 12:49:01,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 12:49:01,994 INFO L477 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 8 treesize of output 7 [2018-11-18 12:49:01,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-18 12:49:02,029 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-11-18 12:49:02,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-18 12:49:02,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:23 [2018-11-18 12:49:02,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-11-18 12:49:02,093 INFO L477 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 35 treesize of output 34 [2018-11-18 12:49:02,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-18 12:49:02,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 12:49:02,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:02,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:02,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:60 [2018-11-18 12:49:02,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:49:02,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2018-11-18 12:49:02,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-18 12:49:02,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,274 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2018-11-18 12:49:02,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-18 12:49:02,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,326 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-18 12:49:02,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:02,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:02,362 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:78, output treesize:60 [2018-11-18 12:49:02,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 57 [2018-11-18 12:49:02,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-11-18 12:49:02,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2018-11-18 12:49:02,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 12:49:02,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:49:02,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 12:49:02,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:50 [2018-11-18 12:49:02,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-11-18 12:49:02,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 29 treesize of output 22 [2018-11-18 12:49:02,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,547 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:49:02,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 12:49:02,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 33 treesize of output 28 [2018-11-18 12:49:02,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 28 treesize of output 21 [2018-11-18 12:49:02,576 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 16 [2018-11-18 12:49:02,589 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:49:02,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-11-18 12:49:02,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-18 12:49:02,618 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-18 12:49:02,623 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,627 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:49:02,634 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:80, output treesize:3 [2018-11-18 12:49:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 76 proven. 30 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 12:49:02,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:49:02,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-11-18 12:49:02,664 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:49:02,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:49:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2017747304, now seen corresponding path program 3 times [2018-11-18 12:49:02,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:49:02,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:49:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:02,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:49:02,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:49:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:49:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 12:49:02,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-18 12:49:02,777 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-18 12:49:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:49:03,003 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-18 12:49:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 12:49:03,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 49 transitions. [2018-11-18 12:49:03,004 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:49:03,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2018-11-18 12:49:03,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:49:03,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:49:03,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:49:03,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:49:03,004 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:49:03,004 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:49:03,004 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:49:03,005 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 12:49:03,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:49:03,005 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:49:03,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:49:03,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:49:03 BoogieIcfgContainer [2018-11-18 12:49:03,009 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:49:03,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:49:03,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:49:03,010 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:49:03,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:48:45" (3/4) ... [2018-11-18 12:49:03,012 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:49:03,013 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:49:03,013 INFO L168 Benchmark]: Toolchain (without parser) took 18111.90 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.2 MB). Free memory was 953.8 MB in the beginning and 1.0 GB in the end (delta: -57.9 MB). Peak memory consumption was 377.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:03,013 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:49:03,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.97 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:03,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.84 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:03,014 INFO L168 Benchmark]: Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:49:03,014 INFO L168 Benchmark]: RCFGBuilder took 234.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:03,015 INFO L168 Benchmark]: BuchiAutomizer took 17665.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 283.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.9 MB). Peak memory consumption was 402.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:49:03,015 INFO L168 Benchmark]: Witness Printer took 3.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:49:03,016 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.97 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.84 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.54 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 234.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17665.39 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 283.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 118.9 MB). Peak memory consumption was 402.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.6s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.4s. Construction of modules took 0.5s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 19/33 HoareTripleCheckerStatistics: 76 SDtfs, 113 SDslu, 195 SDs, 0 SdLazy, 716 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1974 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp40 div100 bol100 ite100 ukn100 eq191 hnf88 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...