./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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 cee692bfa384f30ecd519bc2dc9dfe35c80a4941 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:45:18,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:45:18,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:45:18,080 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:45:18,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:45:18,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:45:18,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:45:18,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:45:18,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:45:18,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:45:18,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:45:18,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:45:18,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:45:18,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:45:18,087 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:45:18,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:45:18,088 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:45:18,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:45:18,091 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:45:18,092 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:45:18,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:45:18,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:45:18,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:45:18,095 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:45:18,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:45:18,096 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:45:18,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:45:18,098 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:45:18,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:45:18,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:45:18,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:45:18,100 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:45:18,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:45:18,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:45:18,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:45:18,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:45:18,102 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:45:18,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:45:18,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:45:18,114 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:45:18,114 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:45:18,114 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:45:18,114 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:45:18,114 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:45:18,115 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:45:18,115 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:45:18,115 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:45:18,115 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:45:18,115 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:45:18,115 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:45:18,115 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:45:18,116 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:45:18,116 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:45:18,116 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:45:18,116 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:45:18,116 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:45:18,116 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:45:18,118 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:45:18,118 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:45:18,118 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:45:18,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:45:18,119 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:45:18,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:45:18,119 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:45:18,119 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:45:18,120 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:45:18,120 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_2e82dc77-9a25-452f-a3df-b23700dc631e/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 -> cee692bfa384f30ecd519bc2dc9dfe35c80a4941 [2018-11-23 05:45:18,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:45:18,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:45:18,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:45:18,158 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:45:18,158 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:45:18,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c [2018-11-23 05:45:18,210 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/data/8c5dd9c76/1097437556014dde9caef355af4104f4/FLAG103a32e29 [2018-11-23 05:45:18,548 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:45:18,549 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/sv-benchmarks/c/termination-restricted-15/NO_23_false-termination_true-no-overflow.c [2018-11-23 05:45:18,553 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/data/8c5dd9c76/1097437556014dde9caef355af4104f4/FLAG103a32e29 [2018-11-23 05:45:18,979 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/data/8c5dd9c76/1097437556014dde9caef355af4104f4 [2018-11-23 05:45:18,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:45:18,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:45:18,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:45:18,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:45:18,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:45:18,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:45:18" (1/1) ... [2018-11-23 05:45:18,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599c0e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:18, skipping insertion in model container [2018-11-23 05:45:18,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:45:18" (1/1) ... [2018-11-23 05:45:18,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:45:19,003 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:45:19,109 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:45:19,112 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:45:19,121 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:45:19,130 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:45:19,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19 WrapperNode [2018-11-23 05:45:19,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:45:19,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:45:19,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:45:19,131 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:45:19,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:45:19,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:45:19,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:45:19,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:45:19,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... [2018-11-23 05:45:19,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:45:19,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:45:19,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:45:19,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:45:19,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:19,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:45:19,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:45:19,316 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:45:19,316 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 05:45:19,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:19 BoogieIcfgContainer [2018-11-23 05:45:19,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:45:19,317 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:45:19,317 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:45:19,320 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:45:19,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:45:19,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:45:18" (1/3) ... [2018-11-23 05:45:19,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c7f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:45:19, skipping insertion in model container [2018-11-23 05:45:19,322 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:45:19,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:19" (2/3) ... [2018-11-23 05:45:19,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c7f10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:45:19, skipping insertion in model container [2018-11-23 05:45:19,323 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:45:19,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:19" (3/3) ... [2018-11-23 05:45:19,324 INFO L375 chiAutomizerObserver]: Analyzing ICFG NO_23_false-termination_true-no-overflow.c [2018-11-23 05:45:19,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:45:19,363 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:45:19,364 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:45:19,364 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:45:19,364 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:45:19,364 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:45:19,364 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:45:19,364 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:45:19,364 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:45:19,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-23 05:45:19,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:45:19,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:45:19,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:45:19,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 05:45:19,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:45:19,393 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:45:19,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-23 05:45:19,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:45:19,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:45:19,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:45:19,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 05:45:19,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:45:19,401 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 7#L10-2true [2018-11-23 05:45:19,401 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-2true assume !!(main_~i~0 < 100); 3#L10true assume main_~i~0 < 50;main_~i~0 := 51; 7#L10-2true [2018-11-23 05:45:19,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 05:45:19,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:19,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:19,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:19,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-23 05:45:19,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:19,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:19,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:19,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-23 05:45:19,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:19,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:19,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:19,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:19,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:19,533 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:19,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:19,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:19,534 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:19,535 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 05:45:19,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:19,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:19,535 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:19,535 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 05:45:19,535 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:19,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:19,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:19,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:19,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:19,639 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:19,640 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:19,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:19,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:19,674 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 05:45:19,675 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_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:19,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:19,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:19,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 05:45:19,694 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_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:19,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:19,701 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:19,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 05:45:19,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:19,757 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 05:45:19,758 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:19,758 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:19,758 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:19,758 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:19,758 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:45:19,758 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:19,759 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:19,759 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:19,759 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-23 05:45:19,759 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:19,759 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:19,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:19,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:19,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:19,821 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:19,825 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:45:19,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:19,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:19,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:19,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:19,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:19,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:45:19,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:45:19,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:19,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:19,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:19,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:19,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:19,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:19,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:45:19,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:45:19,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:19,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:19,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:19,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:19,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:19,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:19,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:19,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:45:19,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:19,857 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:45:19,862 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 05:45:19,862 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 05:45:19,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:45:19,864 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 05:45:19,864 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:45:19,864 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2018-11-23 05:45:19,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 05:45:19,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:19,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:19,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:19,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 05:45:19,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-11-23 05:45:19,982 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2018-11-23 05:45:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:45:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:45:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 05:45:19,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-23 05:45:19,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:19,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 05:45:19,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:19,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-23 05:45:19,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:19,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-23 05:45:19,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:45:19,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-11-23 05:45:19,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-23 05:45:19,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-23 05:45:19,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-23 05:45:19,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:45:19,997 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-23 05:45:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-23 05:45:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 05:45:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 05:45:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-23 05:45:20,019 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-23 05:45:20,019 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-23 05:45:20,019 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:45:20,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-23 05:45:20,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:45:20,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:45:20,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:45:20,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:45:20,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:45:20,021 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 68#L10-2 assume !!(main_~i~0 < 100); 63#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 64#L10-2 [2018-11-23 05:45:20,021 INFO L796 eck$LassoCheckResult]: Loop: 64#L10-2 assume !!(main_~i~0 < 100); 69#L10 assume main_~i~0 < 50;main_~i~0 := 51; 64#L10-2 [2018-11-23 05:45:20,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-23 05:45:20,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:20,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:20,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:20,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:20,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 05:45:20,049 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:45:20,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-23 05:45:20,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:20,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,068 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:20,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:20,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:20,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:20,068 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 05:45:20,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:20,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:20,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:20,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 05:45:20,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:20,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,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-11-23 05:45:20,112 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:20,112 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:20,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:20,141 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 05:45:20,141 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_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:20,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:20,161 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 05:45:20,161 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:20,164 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 05:45:20,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:20,217 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 05:45:20,218 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:20,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:20,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:20,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:20,218 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:45:20,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:20,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:20,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:20,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 05:45:20,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:20,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:20,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,265 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:20,265 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:45:20,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:20,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:45:20,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:45:20,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:20,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:20,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:45:20,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:20,276 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:45:20,279 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 05:45:20,279 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 05:45:20,279 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:45:20,280 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 05:45:20,280 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:45:20,280 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2018-11-23 05:45:20,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 05:45:20,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:20,307 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 05:45:20,307 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 05:45:20,315 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2018-11-23 05:45:20,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:45:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:45:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-23 05:45:20,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 05:45:20,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 05:45:20,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 05:45:20,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-11-23 05:45:20,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:45:20,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-11-23 05:45:20,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 05:45:20,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 05:45:20,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-23 05:45:20,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:45:20,319 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 05:45:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-23 05:45:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 05:45:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 05:45:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-23 05:45:20,320 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-23 05:45:20,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:45:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:45:20,323 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 3 states. [2018-11-23 05:45:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:20,330 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2018-11-23 05:45:20,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:45:20,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2018-11-23 05:45:20,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:45:20,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2018-11-23 05:45:20,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 05:45:20,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 05:45:20,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-23 05:45:20,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:45:20,332 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-23 05:45:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-23 05:45:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 05:45:20,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 05:45:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-23 05:45:20,333 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 05:45:20,334 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 05:45:20,334 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:45:20,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-23 05:45:20,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 05:45:20,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:45:20,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:45:20,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1] [2018-11-23 05:45:20,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 05:45:20,335 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 144#L10-2 assume !!(main_~i~0 < 100); 145#L10 assume main_~i~0 < 50;main_~i~0 := 51; 149#L10-2 assume !!(main_~i~0 < 100); 139#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 140#L10-2 assume !!(main_~i~0 < 100); 146#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 148#L10-2 [2018-11-23 05:45:20,335 INFO L796 eck$LassoCheckResult]: Loop: 148#L10-2 assume !!(main_~i~0 < 100); 147#L10 assume main_~i~0 < 50;main_~i~0 := 51; 148#L10-2 [2018-11-23 05:45:20,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1366043347, now seen corresponding path program 1 times [2018-11-23 05:45:20,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:45:20,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:45:20,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:20,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:45:20,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 05:45:20,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-23 05:45:20,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:20,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,384 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:20,384 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:20,384 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:20,384 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:20,384 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 05:45:20,384 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:20,384 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:20,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:20,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 05:45:20,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:20,385 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:20,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,435 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:20,436 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:20,441 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 05:45:20,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:20,503 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 05:45:20,504 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:20,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:20,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:20,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:20,504 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:45:20,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:20,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:20,504 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:20,505 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 05:45:20,505 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:20,505 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:20,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,534 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:20,534 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:45:20,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:20,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:20,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:45:20,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:20,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:45:20,543 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 05:45:20,543 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 05:45:20,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:45:20,543 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 05:45:20,544 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:45:20,544 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 50 Supporting invariants [] [2018-11-23 05:45:20,544 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 05:45:20,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:20,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 05:45:20,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 05:45:20,580 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2018-11-23 05:45:20,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:45:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:45:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-23 05:45:20,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 05:45:20,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,583 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:45:20,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:20,614 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-23 05:45:20,614 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 05:45:20,630 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 5 states. [2018-11-23 05:45:20,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:45:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:45:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-23 05:45:20,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 05:45:20,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,631 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 05:45:20,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:20,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:20,658 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 1 loop predicates [2018-11-23 05:45:20,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 05:45:20,664 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 15 states and 22 transitions. Complement of second has 4 states. [2018-11-23 05:45:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 05:45:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 05:45:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-23 05:45:20,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-23 05:45:20,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-23 05:45:20,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 05:45:20,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:45:20,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 22 transitions. [2018-11-23 05:45:20,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 05:45:20,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 18 transitions. [2018-11-23 05:45:20,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-23 05:45:20,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 05:45:20,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2018-11-23 05:45:20,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:45:20,669 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2018-11-23 05:45:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2018-11-23 05:45:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 6. [2018-11-23 05:45:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 05:45:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-11-23 05:45:20,670 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2018-11-23 05:45:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:45:20,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:45:20,671 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 3 states. [2018-11-23 05:45:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:20,678 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-11-23 05:45:20,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:45:20,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2018-11-23 05:45:20,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 05:45:20,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 05:45:20,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-23 05:45:20,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-23 05:45:20,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-23 05:45:20,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:45:20,680 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 05:45:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-23 05:45:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 5. [2018-11-23 05:45:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 05:45:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2018-11-23 05:45:20,681 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2018-11-23 05:45:20,681 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2018-11-23 05:45:20,681 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 05:45:20,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2018-11-23 05:45:20,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 05:45:20,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:45:20,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:45:20,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 05:45:20,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-23 05:45:20,682 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 315#L10-2 [2018-11-23 05:45:20,683 INFO L796 eck$LassoCheckResult]: Loop: 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2018-11-23 05:45:20,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-23 05:45:20,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:20,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:20,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:45:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 1 times [2018-11-23 05:45:20,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:45:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 2 times [2018-11-23 05:45:20,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:20,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:20,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:20,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:20,717 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:20,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:20,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:20,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:20,717 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 05:45:20,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:20,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:20,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:20,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-23 05:45:20,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:20,717 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:20,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-11-23 05:45:20,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:20,760 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 05:45:20,762 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/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-11-23 05:45:20,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 05:45:20,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 05:45:20,797 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 05:45:20,798 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:45:20,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:45:20,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:45:20,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:45:20,798 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:45:20,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:45:20,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:45:20,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:45:20,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: NO_23_false-termination_true-no-overflow.c_Iteration4_Lasso [2018-11-23 05:45:20,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:45:20,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:45:20,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,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-11-23 05:45:20,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:45:20,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:45:20,849 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:45:20,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:20,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:45:20,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:45:20,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:20,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:45:20,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:45:20,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:20,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:20,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:45:20,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:20,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:45:20,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:45:20,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:45:20,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,872 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 05:45:20,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,873 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:20,875 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 05:45:20,876 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 05:45:20,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,889 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:20,891 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 05:45:20,891 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 05:45:20,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:20,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,897 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:20,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 05:45:20,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:20,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:20,903 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 05:45:20,903 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 05:45:20,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,905 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 05:45:20,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:20,909 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:20,909 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:20,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,923 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:20,925 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:20,925 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:20,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:20,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:20,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 05:45:20,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:20,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:20,937 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:20,938 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:20,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,941 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 05:45:20,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,943 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:20,945 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 05:45:20,945 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 05:45:20,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,960 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:20,962 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 05:45:20,962 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 05:45:20,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:20,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,969 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:20,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 05:45:20,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:20,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:45:20,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,971 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:20,973 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 05:45:20,973 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 05:45:20,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,977 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 05:45:20,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:20,978 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:20,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,978 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:20,980 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 05:45:20,980 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 05:45:20,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:20,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:20,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:20,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:20,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:20,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:20,995 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:20,996 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 05:45:20,996 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 05:45:21,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:21,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:21,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,002 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:21,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 05:45:21,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:21,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:21,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 05:45:21,006 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 05:45:21,006 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 05:45:21,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,009 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 05:45:21,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,010 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 05:45:21,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,013 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:21,013 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:21,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,026 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 05:45:21,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,029 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:21,029 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:21,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,035 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 05:45:21,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:21,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 05:45:21,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:21,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,038 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 05:45:21,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,040 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:21,040 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:21,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,044 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 05:45:21,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,045 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,045 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:21,048 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 05:45:21,048 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 05:45:21,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,066 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,067 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:21,068 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 05:45:21,068 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 05:45:21,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,076 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:21,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,076 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:21,077 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 05:45:21,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:21,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,079 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,079 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 05:45:21,081 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 05:45:21,081 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 05:45:21,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,088 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 05:45:21,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:21,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,089 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,091 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:21,091 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:21,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:21,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,110 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:21,110 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:21,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,115 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:21,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:21,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,115 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,117 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 05:45:21,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:21,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,119 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 05:45:21,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,120 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 05:45:21,121 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 05:45:21,121 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 05:45:21,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,124 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 05:45:21,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,125 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,126 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 05:45:21,128 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 05:45:21,128 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 05:45:21,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,175 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,175 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 05:45:21,177 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 05:45:21,177 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 05:45:21,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,183 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,183 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:45:21,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,184 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 05:45:21,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:45:21,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:45:21,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:45:21,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 05:45:21,187 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 05:45:21,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:45:21,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:45:21,187 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 05:45:21,189 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 05:45:21,189 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 05:45:21,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:45:21,194 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-23 05:45:21,194 INFO L794 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2018-11-23 05:45:21,194 INFO L796 eck$LassoCheckResult]: Loop: 315#L10-2 assume !!(main_~i~0 < 100); 316#L10 assume main_~i~0 < 50;main_~i~0 := 51; 317#L10-2 assume !!(main_~i~0 < 100); 314#L10 assume !(main_~i~0 < 50);main_~i~0 := 49; 315#L10-2 [2018-11-23 05:45:21,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash 29863400, now seen corresponding path program 3 times [2018-11-23 05:45:21,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:21,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:21,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:45:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:21,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1234249, now seen corresponding path program 2 times [2018-11-23 05:45:21,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:21,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:21,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:21,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:45:21,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:21,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1492334512, now seen corresponding path program 4 times [2018-11-23 05:45:21,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:45:21,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:45:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:21,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:45:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- [2018-11-23 05:45:21,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:45:21 BoogieIcfgContainer [2018-11-23 05:45:21,336 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:45:21,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:45:21,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:45:21,337 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:45:21,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:19" (3/4) ... [2018-11-23 05:45:21,340 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- [2018-11-23 05:45:21,382 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2e82dc77-9a25-452f-a3df-b23700dc631e/bin-2019/uautomizer/witness.graphml [2018-11-23 05:45:21,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:45:21,383 INFO L168 Benchmark]: Toolchain (without parser) took 2400.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.6 MB). Free memory was 958.5 MB in the beginning and 1.2 GB in the end (delta: -257.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:45:21,385 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:45:21,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.91 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:21,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.95 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:45:21,386 INFO L168 Benchmark]: Boogie Preprocessor took 12.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:21,386 INFO L168 Benchmark]: RCFGBuilder took 154.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:21,387 INFO L168 Benchmark]: BuchiAutomizer took 2018.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.2 MB). Peak memory consumption was 310.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:21,387 INFO L168 Benchmark]: Witness Printer took 46.22 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:21,390 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.91 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 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.95 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 154.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2018.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -98.2 MB). Peak memory consumption was 310.0 MB. Max. memory is 11.5 GB. * Witness Printer took 46.22 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + 50 and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 50 and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + 50 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 4 iterations. TraceHistogramMax:3. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 22 SDslu, 3 SDs, 0 SdLazy, 39 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax250 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf91 smp100 dnf100 smp100 tf118 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {\result=0, i=49} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_~i~0;havoc main_~i~0;main_~i~0 := 0; [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_~i~0; [L6] havoc main_~i~0; [L7] main_~i~0 := 0; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] ~i~0 := 0; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !!(main_~i~0 < 100); [?] assume main_~i~0 < 50;main_~i~0 := 51; [?] assume !!(main_~i~0 < 100); [?] assume !(main_~i~0 < 50);main_~i~0 := 49; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume main_~i~0 < 50; [L10] main_~i~0 := 51; [L9-L12] assume !!(main_~i~0 < 100); [L10-L11] assume !(main_~i~0 < 50); [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND TRUE main_~i~0 < 50 [L10] main_~i~0 := 51; [L9-L12] COND FALSE !(!(main_~i~0 < 100)) [L10] COND FALSE !(main_~i~0 < 50) [L11] main_~i~0 := 49; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND TRUE ~i~0 < 50 [L10] ~i~0 := 51; [L9-L12] COND FALSE !(!(~i~0 < 100)) [L10] COND FALSE !(~i~0 < 50) [L11] ~i~0 := 49; [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 Loop: [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = 51 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = 49 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...