./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/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 687269bb6882b72a3d48999f1e5c55a1d5283a94 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:33:34,473 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:33:34,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:33:34,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:33:34,481 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:33:34,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:33:34,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:33:34,483 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:33:34,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:33:34,484 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:33:34,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:33:34,485 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:33:34,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:33:34,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:33:34,486 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:33:34,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:33:34,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:33:34,488 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:33:34,489 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:33:34,491 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:33:34,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:33:34,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:33:34,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:33:34,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:33:34,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:33:34,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:33:34,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:33:34,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:33:34,495 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:33:34,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:33:34,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:33:34,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:33:34,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:33:34,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:33:34,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:33:34,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:33:34,497 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 10:33:34,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:33:34,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:33:34,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 10:33:34,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 10:33:34,509 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 10:33:34,509 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 10:33:34,509 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 10:33:34,509 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 10:33:34,510 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 10:33:34,510 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 10:33:34,510 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 10:33:34,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:33:34,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 10:33:34,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:33:34,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:33:34,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 10:33:34,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 10:33:34,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 10:33:34,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:33:34,511 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 10:33:34,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 10:33:34,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 10:33:34,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:33:34,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:33:34,512 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 10:33:34,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:33:34,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 10:33:34,513 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 10:33:34,513 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 10:33:34,513 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_a6659d2d-9698-426e-a6ac-27d5dc198608/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 -> 687269bb6882b72a3d48999f1e5c55a1d5283a94 [2018-12-09 10:33:34,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:33:34,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:33:34,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:33:34,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:33:34,547 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:33:34,547 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 10:33:34,584 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/data/fedc7af07/ef8e1fcb0cf34fcbb7dd3046a1083415/FLAG8bbfa8df4 [2018-12-09 10:33:34,922 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:33:34,923 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 10:33:34,926 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/data/fedc7af07/ef8e1fcb0cf34fcbb7dd3046a1083415/FLAG8bbfa8df4 [2018-12-09 10:33:34,935 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/data/fedc7af07/ef8e1fcb0cf34fcbb7dd3046a1083415 [2018-12-09 10:33:34,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:33:34,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:33:34,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:33:34,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:33:34,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:33:34,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:33:34" (1/1) ... [2018-12-09 10:33:34,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd2551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:34, skipping insertion in model container [2018-12-09 10:33:34,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:33:34" (1/1) ... [2018-12-09 10:33:34,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:33:34,956 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:33:35,039 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:33:35,041 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:33:35,050 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:33:35,058 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:33:35,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35 WrapperNode [2018-12-09 10:33:35,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:33:35,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:33:35,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:33:35,059 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:33:35,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:33:35,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:33:35,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:33:35,078 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:33:35,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... [2018-12-09 10:33:35,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:33:35,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:33:35,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:33:35,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:33:35,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/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-12-09 10:33:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:33:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:33:35,223 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:33:35,223 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 10:33:35,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:33:35 BoogieIcfgContainer [2018-12-09 10:33:35,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:33:35,224 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 10:33:35,224 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 10:33:35,226 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 10:33:35,226 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:33:35,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 10:33:34" (1/3) ... [2018-12-09 10:33:35,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@470f1339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:33:35, skipping insertion in model container [2018-12-09 10:33:35,227 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:33:35,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:33:35" (2/3) ... [2018-12-09 10:33:35,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@470f1339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 10:33:35, skipping insertion in model container [2018-12-09 10:33:35,227 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 10:33:35,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:33:35" (3/3) ... [2018-12-09 10:33:35,228 INFO L375 chiAutomizerObserver]: Analyzing ICFG TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 10:33:35,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 10:33:35,260 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 10:33:35,260 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 10:33:35,260 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 10:33:35,260 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:33:35,260 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:33:35,260 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 10:33:35,260 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:33:35,260 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 10:33:35,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-09 10:33:35,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:33:35,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:35,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:35,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 10:33:35,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:35,283 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 10:33:35,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-09 10:33:35,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:33:35,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:35,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:35,284 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 10:33:35,284 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:35,289 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L25-2true [2018-12-09 10:33:35,289 INFO L796 eck$LassoCheckResult]: Loop: 8#L25-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 12#L25true assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4#L26true assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 10#L26-2true main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8#L25-2true [2018-12-09 10:33:35,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-09 10:33:35,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:35,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:35,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:35,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1234440, now seen corresponding path program 1 times [2018-12-09 10:33:35,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:35,359 INFO L82 PathProgramCache]: Analyzing trace with hash 29863591, now seen corresponding path program 1 times [2018-12-09 10:33:35,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,419 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:35,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:35,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:35,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:35,420 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:35,420 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:35,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:35,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-12-09 10:33:35,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:35,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:35,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:35,502 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:35,506 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:35,524 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:35,525 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:35,528 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:35,543 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:35,543 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:35,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:35,548 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:35,549 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:35,564 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:35,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:35,620 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:35,621 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:35,621 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:35,621 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:35,621 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:35,621 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:35,621 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,621 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:35,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:35,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-12-09 10:33:35,622 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:35,622 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:35,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,677 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:35,680 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:35,681 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-12-09 10:33:35,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:35,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:35,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:35,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:35,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:35,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:35,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:35,689 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-12-09 10:33:35,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:35,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:35,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:35,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:35,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:35,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:35,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:35,696 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-12-09 10:33:35,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:35,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:35,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:35,697 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:33:35,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:35,698 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:33:35,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:35,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:35,701 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-12-09 10:33:35,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:35,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:35,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:35,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:35,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:35,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:35,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:35,707 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:35,710 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:35,710 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:35,712 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:35,712 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:35,712 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:35,712 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:35,713 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:35,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:35,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:35,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:35,782 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:35,783 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2018-12-09 10:33:35,816 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 40 states and 55 transitions. Complement of second has 8 states. [2018-12-09 10:33:35,816 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-12-09 10:33:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:35,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-09 10:33:35,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-09 10:33:35,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:35,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 10:33:35,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:35,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 8 letters. [2018-12-09 10:33:35,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:35,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2018-12-09 10:33:35,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:33:35,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 21 states and 30 transitions. [2018-12-09 10:33:35,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 10:33:35,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 10:33:35,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2018-12-09 10:33:35,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:35,825 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-09 10:33:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2018-12-09 10:33:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-12-09 10:33:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 10:33:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-12-09 10:33:35,841 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-09 10:33:35,841 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-09 10:33:35,841 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 10:33:35,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-12-09 10:33:35,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:33:35,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:35,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:35,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 10:33:35,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:35,842 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 103#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 106#L25 [2018-12-09 10:33:35,842 INFO L796 eck$LassoCheckResult]: Loop: 106#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 97#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 98#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 105#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 106#L25 [2018-12-09 10:33:35,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:35,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2018-12-09 10:33:35,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:35,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:35,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:35,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1328732, now seen corresponding path program 1 times [2018-12-09 10:33:35,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:35,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:35,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 925773253, now seen corresponding path program 1 times [2018-12-09 10:33:35,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:35,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:35,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:35,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:35,875 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:35,875 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:35,875 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:35,875 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:35,875 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:35,875 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,875 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:35,875 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:35,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-12-09 10:33:35,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:35,875 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:35,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:35,927 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:35,927 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:35,929 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:35,945 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:35,945 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:35,948 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:35,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:35,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:36,044 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:36,045 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:36,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:36,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:36,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:36,046 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:36,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:36,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:36,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-12-09 10:33:36,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:36,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:36,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,089 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:36,089 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:36,089 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-12-09 10:33:36,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:36,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:36,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:36,093 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-12-09 10:33:36,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:36,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:36,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:36,098 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:36,101 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:36,101 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:36,101 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:36,101 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:36,101 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:36,101 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:36,101 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:36,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:36,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:36,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:36,123 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-12-09 10:33:36,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-09 10:33:36,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2018-12-09 10:33:36,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-09 10:33:36,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 10:33:36,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 10:33:36,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-09 10:33:36,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2018-12-09 10:33:36,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:33:36,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 21 states and 30 transitions. [2018-12-09 10:33:36,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 10:33:36,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 10:33:36,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2018-12-09 10:33:36,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:36,142 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-09 10:33:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2018-12-09 10:33:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-09 10:33:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 10:33:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-12-09 10:33:36,144 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-12-09 10:33:36,144 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-12-09 10:33:36,144 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 10:33:36,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2018-12-09 10:33:36,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:33:36,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:36,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:36,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 10:33:36,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:36,145 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 191#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 198#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 192#L33 [2018-12-09 10:33:36,145 INFO L796 eck$LassoCheckResult]: Loop: 192#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 184#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 185#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 199#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 192#L33 [2018-12-09 10:33:36,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 31084, now seen corresponding path program 1 times [2018-12-09 10:33:36,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 1 times [2018-12-09 10:33:36,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:36,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1357271332, now seen corresponding path program 1 times [2018-12-09 10:33:36,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,182 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:36,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:36,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:36,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:36,183 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:36,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:36,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:36,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-12-09 10:33:36,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:36,183 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:36,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,235 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:36,235 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:36,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:36,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:36,239 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:36,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:36,268 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:36,268 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:36,271 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:36,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:36,352 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:36,353 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:36,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:36,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:36,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:36,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:36,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:36,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:36,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-12-09 10:33:36,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:36,354 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:36,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,400 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:36,400 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:36,401 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-12-09 10:33:36,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:36,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:36,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:36,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:36,402 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-12-09 10:33:36,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:36,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:36,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:36,407 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-12-09 10:33:36,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:36,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:36,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:36,413 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:36,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:36,416 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:36,416 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:36,416 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:36,416 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:36,416 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 10:33:36,417 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:36,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:36,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:36,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:36,447 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:36,447 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-09 10:33:36,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 32 states and 48 transitions. Complement of second has 7 states. [2018-12-09 10:33:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 10:33:36,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-09 10:33:36,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-09 10:33:36,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 8 letters. [2018-12-09 10:33:36,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 48 transitions. [2018-12-09 10:33:36,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:33:36,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 38 transitions. [2018-12-09 10:33:36,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 10:33:36,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 10:33:36,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 38 transitions. [2018-12-09 10:33:36,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:36,467 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 38 transitions. [2018-12-09 10:33:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 38 transitions. [2018-12-09 10:33:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-09 10:33:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 10:33:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2018-12-09 10:33:36,469 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-12-09 10:33:36,469 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2018-12-09 10:33:36,469 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 10:33:36,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2018-12-09 10:33:36,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-09 10:33:36,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:36,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:36,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-09 10:33:36,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:36,470 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 291#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 298#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 292#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 283#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 284#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 302#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 285#L26 [2018-12-09 10:33:36,470 INFO L796 eck$LassoCheckResult]: Loop: 285#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 286#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 282#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 301#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 285#L26 [2018-12-09 10:33:36,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1357211759, now seen corresponding path program 1 times [2018-12-09 10:33:36,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:36,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1419720, now seen corresponding path program 2 times [2018-12-09 10:33:36,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -369493672, now seen corresponding path program 1 times [2018-12-09 10:33:36,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:36,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,515 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:36,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:36,515 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:36,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:36,515 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:36,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,515 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:36,515 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:36,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-12-09 10:33:36,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:36,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:36,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,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-12-09 10:33:36,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,558 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:36,558 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,560 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:36,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:36,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:36,563 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:36,577 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:36,595 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:36,703 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:36,704 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:36,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:36,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:36,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:36,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:36,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:36,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:36,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-12-09 10:33:36,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:36,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:36,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,755 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:36,755 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:36,755 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-12-09 10:33:36,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:36,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,756 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:33:36,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,756 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:33:36,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:36,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:36,758 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-12-09 10:33:36,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:36,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:36,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:36,762 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:36,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:36,764 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:36,764 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:36,764 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:36,765 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:36,765 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:36,765 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:36,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:36,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:36,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:36,795 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:36,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-12-09 10:33:36,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 78 states and 116 transitions. Complement of second has 7 states. [2018-12-09 10:33:36,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-09 10:33:36,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-09 10:33:36,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-09 10:33:36,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-09 10:33:36,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:36,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 116 transitions. [2018-12-09 10:33:36,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:33:36,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 55 states and 80 transitions. [2018-12-09 10:33:36,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 10:33:36,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 10:33:36,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 80 transitions. [2018-12-09 10:33:36,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:36,817 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 80 transitions. [2018-12-09 10:33:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 80 transitions. [2018-12-09 10:33:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-12-09 10:33:36,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 10:33:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2018-12-09 10:33:36,819 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2018-12-09 10:33:36,819 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2018-12-09 10:33:36,819 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 10:33:36,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 63 transitions. [2018-12-09 10:33:36,820 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 10:33:36,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:36,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:36,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:33:36,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:36,820 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 451#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 459#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 460#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 476#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 475#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 472#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 470#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 446#L26-2 [2018-12-09 10:33:36,820 INFO L796 eck$LassoCheckResult]: Loop: 446#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 482#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 465#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 445#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 446#L26-2 [2018-12-09 10:33:36,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash 876108449, now seen corresponding path program 1 times [2018-12-09 10:33:36,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1529372, now seen corresponding path program 2 times [2018-12-09 10:33:36,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1432445116, now seen corresponding path program 1 times [2018-12-09 10:33:36,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:36,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:36,857 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:36,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:36,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:36,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:36,857 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:36,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:36,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:36,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-12-09 10:33:36,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:36,857 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:36,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:36,907 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:36,911 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:36,927 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:36,944 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:36,945 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:36,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:36,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:36,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:36,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:36,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:36,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:36,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:36,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-12-09 10:33:36,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:36,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:36,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-12-09 10:33:36,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-12-09 10:33:36,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:36,985 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:36,985 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:36,985 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-12-09 10:33:36,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:36,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:36,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:36,988 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-12-09 10:33:36,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:36,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:36,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:36,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:36,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:36,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:36,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:36,990 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:36,991 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:36,991 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:36,991 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:36,991 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:36,991 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:36,991 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:36,992 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:37,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:37,016 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-12-09 10:33:37,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-12-09 10:33:37,026 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 106 states and 158 transitions. Complement of second has 7 states. [2018-12-09 10:33:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-09 10:33:37,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-09 10:33:37,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2018-12-09 10:33:37,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2018-12-09 10:33:37,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 158 transitions. [2018-12-09 10:33:37,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 10:33:37,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 90 states and 129 transitions. [2018-12-09 10:33:37,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-09 10:33:37,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-09 10:33:37,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 129 transitions. [2018-12-09 10:33:37,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:37,031 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 129 transitions. [2018-12-09 10:33:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 129 transitions. [2018-12-09 10:33:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2018-12-09 10:33:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 10:33:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2018-12-09 10:33:37,035 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2018-12-09 10:33:37,035 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2018-12-09 10:33:37,035 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 10:33:37,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2018-12-09 10:33:37,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-12-09 10:33:37,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:37,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:37,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:33:37,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:37,036 INFO L794 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 658#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 666#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 667#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 682#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 681#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 679#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 677#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 676#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 675#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 671#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 672#L33 [2018-12-09 10:33:37,036 INFO L796 eck$LassoCheckResult]: Loop: 672#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 721#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 719#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 718#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 672#L33 [2018-12-09 10:33:37,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 2 times [2018-12-09 10:33:37,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 2 times [2018-12-09 10:33:37,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,047 INFO L82 PathProgramCache]: Analyzing trace with hash -4707247, now seen corresponding path program 1 times [2018-12-09 10:33:37,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:37,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,071 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:37,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:37,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:37,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:37,071 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:37,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:37,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:37,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-12-09 10:33:37,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:37,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:37,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,104 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:37,105 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:37,106 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:37,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:37,188 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:37,189 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:37,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:37,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:37,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:37,190 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:37,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:37,190 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:37,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-12-09 10:33:37,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:37,190 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:37,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,235 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:37,235 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:37,236 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-12-09 10:33:37,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:37,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:37,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:37,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:37,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:37,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:37,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:37,238 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:37,240 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:37,240 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:37,240 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:37,240 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:37,240 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:37,240 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-12-09 10:33:37,240 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:37,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:37,264 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:37,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2018-12-09 10:33:37,277 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 112 states and 173 transitions. Complement of second has 7 states. [2018-12-09 10:33:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:37,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 10:33:37,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-09 10:33:37,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,278 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:33:37,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:37,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:37,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2018-12-09 10:33:37,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 107 states and 160 transitions. Complement of second has 7 states. [2018-12-09 10:33:37,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 10:33:37,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-09 10:33:37,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,320 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:33:37,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:37,351 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:37,351 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2018-12-09 10:33:37,368 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 128 states and 203 transitions. Complement of second has 8 states. [2018-12-09 10:33:37,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-09 10:33:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-09 10:33:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 10:33:37,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-09 10:33:37,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 203 transitions. [2018-12-09 10:33:37,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-12-09 10:33:37,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 97 states and 147 transitions. [2018-12-09 10:33:37,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-09 10:33:37,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-09 10:33:37,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 147 transitions. [2018-12-09 10:33:37,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:37,372 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 147 transitions. [2018-12-09 10:33:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 147 transitions. [2018-12-09 10:33:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2018-12-09 10:33:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 10:33:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2018-12-09 10:33:37,375 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2018-12-09 10:33:37,375 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2018-12-09 10:33:37,375 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 10:33:37,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 100 transitions. [2018-12-09 10:33:37,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-12-09 10:33:37,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:37,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:37,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-09 10:33:37,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:33:37,376 INFO L794 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1282#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1283#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 1286#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1285#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1268#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1261#L33 [2018-12-09 10:33:37,376 INFO L796 eck$LassoCheckResult]: Loop: 1261#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1252#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1253#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1265#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1254#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1255#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1266#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1316#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1261#L33 [2018-12-09 10:33:37,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 1 times [2018-12-09 10:33:37,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:37,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,380 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 1 times [2018-12-09 10:33:37,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:37,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash -725918680, now seen corresponding path program 1 times [2018-12-09 10:33:37,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:37,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,419 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:37,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:37,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:37,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:37,419 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:37,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,419 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:37,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:37,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-12-09 10:33:37,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:37,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:37,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:37,460 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:37,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:37,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:37,465 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:37,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:37,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:37,494 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:37,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:37,512 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:37,512 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:37,515 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:37,533 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:37,629 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:37,630 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:37,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:37,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:37,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:37,631 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:37,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:37,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:37,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-12-09 10:33:37,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:37,631 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:37,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,677 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:37,677 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:37,677 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-12-09 10:33:37,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:37,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:37,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:37,678 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:33:37,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:37,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:33:37,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:37,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:37,680 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-12-09 10:33:37,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:37,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:37,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:37,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:37,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:37,681 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:37,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:37,683 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-12-09 10:33:37,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:37,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:37,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:37,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:37,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:37,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:37,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:37,686 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-12-09 10:33:37,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:37,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:37,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:37,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:37,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:37,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:37,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:37,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:37,691 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:37,691 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:37,691 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:37,691 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:37,691 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:37,692 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:37,692 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:37,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:37,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:37,747 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-12-09 10:33:37,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43 Second operand 5 states. [2018-12-09 10:33:37,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 246 states and 366 transitions. Complement of second has 13 states. [2018-12-09 10:33:37,785 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-12-09 10:33:37,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:33:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-12-09 10:33:37,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-09 10:33:37,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2018-12-09 10:33:37,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2018-12-09 10:33:37,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:37,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 366 transitions. [2018-12-09 10:33:37,788 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2018-12-09 10:33:37,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 208 states and 314 transitions. [2018-12-09 10:33:37,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-09 10:33:37,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-12-09 10:33:37,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 314 transitions. [2018-12-09 10:33:37,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:37,790 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 314 transitions. [2018-12-09 10:33:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 314 transitions. [2018-12-09 10:33:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 188. [2018-12-09 10:33:37,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-09 10:33:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2018-12-09 10:33:37,799 INFO L728 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2018-12-09 10:33:37,799 INFO L608 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2018-12-09 10:33:37,799 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 10:33:37,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. [2018-12-09 10:33:37,800 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2018-12-09 10:33:37,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:37,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:37,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:33:37,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:33:37,801 INFO L794 eck$LassoCheckResult]: Stem: 1652#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1653#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1687#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1685#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 1683#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1682#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1680#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1675#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1676#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1782#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1778#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1771#L33 [2018-12-09 10:33:37,801 INFO L796 eck$LassoCheckResult]: Loop: 1771#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1761#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1762#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1746#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1672#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1673#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1784#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1781#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1771#L33 [2018-12-09 10:33:37,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 3 times [2018-12-09 10:33:37,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:37,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 2 times [2018-12-09 10:33:37,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash -742368616, now seen corresponding path program 2 times [2018-12-09 10:33:37,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:37,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:37,846 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:37,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:37,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:37,847 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:37,847 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:37,847 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,847 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:37,847 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:37,847 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-12-09 10:33:37,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:37,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:37,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:37,898 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:37,899 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:37,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:37,914 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:37,914 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:37,917 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:37,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:37,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:38,070 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:38,072 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:38,072 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:38,072 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:38,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:38,072 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:38,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:38,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:38,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-12-09 10:33:38,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:38,073 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:38,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,121 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:38,121 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:38,121 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-12-09 10:33:38,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:38,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:38,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:38,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:38,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:38,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:38,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:38,123 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-12-09 10:33:38,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:38,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:38,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:38,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:38,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:38,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:38,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:38,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:38,128 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:38,128 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:38,128 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:38,128 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:38,128 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:38,128 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:38,129 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:38,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:38,159 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-12-09 10:33:38,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2018-12-09 10:33:38,214 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 330 states and 503 transitions. Complement of second has 13 states. [2018-12-09 10:33:38,214 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-12-09 10:33:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:33:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-12-09 10:33:38,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-09 10:33:38,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,215 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:33:38,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:38,250 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-09 10:33:38,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2018-12-09 10:33:38,301 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 326 states and 483 transitions. Complement of second has 15 states. [2018-12-09 10:33:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:33:38,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-12-09 10:33:38,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-09 10:33:38,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,301 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:33:38,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:38,331 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-09 10:33:38,331 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2018-12-09 10:33:38,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 525 states and 786 transitions. Complement of second has 23 states. [2018-12-09 10:33:38,376 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-12-09 10:33:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:33:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2018-12-09 10:33:38,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. [2018-12-09 10:33:38,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 19 letters. Loop has 8 letters. [2018-12-09 10:33:38,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 16 letters. [2018-12-09 10:33:38,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 786 transitions. [2018-12-09 10:33:38,381 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2018-12-09 10:33:38,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 342 states and 512 transitions. [2018-12-09 10:33:38,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-12-09 10:33:38,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-12-09 10:33:38,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 512 transitions. [2018-12-09 10:33:38,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:38,383 INFO L705 BuchiCegarLoop]: Abstraction has 342 states and 512 transitions. [2018-12-09 10:33:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 512 transitions. [2018-12-09 10:33:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 205. [2018-12-09 10:33:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-09 10:33:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2018-12-09 10:33:38,389 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2018-12-09 10:33:38,389 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2018-12-09 10:33:38,389 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 10:33:38,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 317 transitions. [2018-12-09 10:33:38,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2018-12-09 10:33:38,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:38,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:38,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-09 10:33:38,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-09 10:33:38,391 INFO L794 eck$LassoCheckResult]: Stem: 3285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 3286#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3327#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 3328#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 3362#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3335#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3299#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 3300#L33 [2018-12-09 10:33:38,391 INFO L796 eck$LassoCheckResult]: Loop: 3300#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 3421#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3422#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3412#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 3414#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 3470#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3469#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3415#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 3300#L33 [2018-12-09 10:33:38,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 2 times [2018-12-09 10:33:38,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:38,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:38,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1729619210, now seen corresponding path program 1 times [2018-12-09 10:33:38,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:38,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1535265306, now seen corresponding path program 1 times [2018-12-09 10:33:38,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:38,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:38,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:38,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,439 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:38,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:38,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:38,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:38,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:38,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:38,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:38,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Loop [2018-12-09 10:33:38,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:38,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:38,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,485 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:38,485 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:38,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:38,504 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:38,504 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:38,507 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:38,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:38,509 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:38,524 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:38,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:38,602 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:38,603 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:38,603 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:38,603 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:38,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:38,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:38,604 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,604 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:38,604 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:38,604 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Loop [2018-12-09 10:33:38,604 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:38,604 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:38,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:38,657 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:38,657 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-12-09 10:33:38,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:38,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:38,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:38,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:38,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:38,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:38,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:38,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-12-09 10:33:38,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:38,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:38,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:38,661 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 10:33:38,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:38,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 10:33:38,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:38,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:38,663 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-12-09 10:33:38,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:38,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:38,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:38,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:38,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:38,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:38,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:38,666 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:38,668 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:38,668 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:38,668 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:38,668 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:38,668 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:38,668 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:38,669 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:38,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:38,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:38,701 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-12-09 10:33:38,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133 Second operand 5 states. [2018-12-09 10:33:38,743 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133. Second operand 5 states. Result 490 states and 759 transitions. Complement of second has 12 states. [2018-12-09 10:33:38,743 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-12-09 10:33:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 10:33:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-12-09 10:33:38,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-09 10:33:38,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2018-12-09 10:33:38,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2018-12-09 10:33:38,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:38,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 759 transitions. [2018-12-09 10:33:38,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-09 10:33:38,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 285 states and 426 transitions. [2018-12-09 10:33:38,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 10:33:38,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-09 10:33:38,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 426 transitions. [2018-12-09 10:33:38,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 10:33:38,761 INFO L705 BuchiCegarLoop]: Abstraction has 285 states and 426 transitions. [2018-12-09 10:33:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 426 transitions. [2018-12-09 10:33:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 193. [2018-12-09 10:33:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-09 10:33:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2018-12-09 10:33:38,766 INFO L728 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2018-12-09 10:33:38,766 INFO L608 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2018-12-09 10:33:38,766 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 10:33:38,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 295 transitions. [2018-12-09 10:33:38,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 10:33:38,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 10:33:38,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 10:33:38,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1] [2018-12-09 10:33:38,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 10:33:38,768 INFO L794 eck$LassoCheckResult]: Stem: 4063#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 4064#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4084#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4088#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4085#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4087#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4081#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 4082#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 4134#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 4131#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4128#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4130#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4141#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4140#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4137#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4079#L26 [2018-12-09 10:33:38,768 INFO L796 eck$LassoCheckResult]: Loop: 4079#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4074#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4075#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4078#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4079#L26 [2018-12-09 10:33:38,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash -725859107, now seen corresponding path program 1 times [2018-12-09 10:33:38,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:38,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:38,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:38,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1479302, now seen corresponding path program 3 times [2018-12-09 10:33:38,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:38,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:33:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash -517142174, now seen corresponding path program 2 times [2018-12-09 10:33:38,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 10:33:38,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 10:33:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:33:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:33:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:33:38,803 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:38,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:38,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:38,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:38,803 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 10:33:38,803 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:38,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:38,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-12-09 10:33:38,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:38,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:38,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,847 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:38,847 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:38,850 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:38,865 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:38,865 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:38,868 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:38,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 10:33:38,891 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 10:33:38,894 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6659d2d-9698-426e-a6ac-27d5dc198608/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 10:33:38,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 10:33:38,979 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 10:33:38,981 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 10:33:38,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 10:33:38,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 10:33:38,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 10:33:38,981 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 10:33:38,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 10:33:38,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 10:33:38,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 10:33:38,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-12-09 10:33:38,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 10:33:38,981 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 10:33:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:38,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 10:33:39,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 10:33:39,025 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 10:33:39,025 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-12-09 10:33:39,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:39,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:39,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:39,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:39,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:39,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:39,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:39,028 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-12-09 10:33:39,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:39,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:39,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:39,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:39,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 10:33:39,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 10:33:39,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 10:33:39,030 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-12-09 10:33:39,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 10:33:39,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 10:33:39,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 10:33:39,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 10:33:39,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 10:33:39,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 10:33:39,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 10:33:39,033 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 10:33:39,034 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 10:33:39,034 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 10:33:39,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 10:33:39,035 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 10:33:39,035 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 10:33:39,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-12-09 10:33:39,035 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 10:33:39,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:39,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:39,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:39,067 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:39,067 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2018-12-09 10:33:39,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 302 states and 452 transitions. Complement of second has 7 states. [2018-12-09 10:33:39,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-09 10:33:39,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 10:33:39,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:39,082 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:33:39,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:39,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:39,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:39,103 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:39,103 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2018-12-09 10:33:39,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 313 states and 443 transitions. Complement of second has 7 states. [2018-12-09 10:33:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 10:33:39,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 10:33:39,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:39,117 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 10:33:39,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:33:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:39,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:33:39,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 10:33:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:33:39,142 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 10:33:39,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2018-12-09 10:33:39,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 423 states and 703 transitions. Complement of second has 8 states. [2018-12-09 10:33:39,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 10:33:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 10:33:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-12-09 10:33:39,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 10:33:39,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:39,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-09 10:33:39,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:39,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 8 letters. [2018-12-09 10:33:39,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 10:33:39,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 703 transitions. [2018-12-09 10:33:39,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:33:39,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 0 states and 0 transitions. [2018-12-09 10:33:39,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 10:33:39,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 10:33:39,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 10:33:39,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 10:33:39,160 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:33:39,160 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:33:39,160 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 10:33:39,160 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 10:33:39,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 10:33:39,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 10:33:39,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 10:33:39,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 10:33:39 BoogieIcfgContainer [2018-12-09 10:33:39,165 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 10:33:39,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:33:39,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:33:39,166 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:33:39,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:33:35" (3/4) ... [2018-12-09 10:33:39,169 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 10:33:39,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:33:39,170 INFO L168 Benchmark]: Toolchain (without parser) took 4232.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -246.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2018-12-09 10:33:39,171 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:33:39,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 120.49 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:33:39,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.49 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:33:39,172 INFO L168 Benchmark]: Boogie Preprocessor took 40.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 10:33:39,172 INFO L168 Benchmark]: RCFGBuilder took 105.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:33:39,173 INFO L168 Benchmark]: BuchiAutomizer took 3941.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.2 MB). Peak memory consumption was 86.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:33:39,173 INFO L168 Benchmark]: Witness Printer took 3.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:33:39,175 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 120.49 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 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 18.49 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 105.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3941.62 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.2 MB). Peak memory consumption was 86.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (0 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 7 locations. One deterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 316 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 205 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 191 SDtfs, 249 SDslu, 111 SDs, 0 SdLazy, 311 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT10 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax150 hnf98 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp100 dnf100 smp100 tf107 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...