./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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 32bit --witnessprinter.graph.data.programhash e1aefec8ddab0c97dfdccb598d218efc3fd3f309 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 11:05:52,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:05:52,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:05:52,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:05:52,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:05:52,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:05:52,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:05:52,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:05:52,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:05:52,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:05:52,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:05:52,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:05:52,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:05:52,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:05:52,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:05:52,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:05:52,281 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:05:52,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:05:52,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:05:52,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:05:52,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:05:52,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:05:52,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:05:52,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:05:52,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:05:52,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:05:52,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:05:52,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:05:52,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:05:52,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:05:52,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:05:52,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:05:52,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:05:52,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:05:52,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:05:52,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:05:52,296 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:05:52,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:05:52,309 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:05:52,310 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:05:52,310 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:05:52,310 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:05:52,310 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:05:52,310 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:05:52,310 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:05:52,311 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:05:52,311 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:05:52,311 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:05:52,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:05:52,311 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:05:52,311 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:05:52,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:05:52,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:05:52,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:05:52,312 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:05:52,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:05:52,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:05:52,313 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:05:52,313 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:05:52,313 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:05:52,313 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:05:52,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:05:52,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:05:52,314 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:05:52,314 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:05:52,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:05:52,314 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:05:52,314 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:05:52,315 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:05:52,315 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_7c5a3fde-27b4-482f-bf94-1f2737427271/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1aefec8ddab0c97dfdccb598d218efc3fd3f309 [2018-11-28 11:05:52,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:05:52,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:05:52,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:05:52,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:05:52,354 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:05:52,354 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-11-28 11:05:52,396 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/data/ddaf48eb0/6b8665853b264ab78e10dc6df72906f0/FLAGaaff9c70b [2018-11-28 11:05:52,786 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:05:52,787 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/sv-benchmarks/c/eca-rers2012/Problem02_label07_true-unreach-call_false-termination.c [2018-11-28 11:05:52,796 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/data/ddaf48eb0/6b8665853b264ab78e10dc6df72906f0/FLAGaaff9c70b [2018-11-28 11:05:53,156 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/data/ddaf48eb0/6b8665853b264ab78e10dc6df72906f0 [2018-11-28 11:05:53,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:05:53,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:05:53,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:05:53,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:05:53,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:05:53,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a311fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53, skipping insertion in model container [2018-11-28 11:05:53,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:05:53,201 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:05:53,415 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:05:53,419 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:05:53,486 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:05:53,553 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:05:53,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53 WrapperNode [2018-11-28 11:05:53,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:05:53,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:05:53,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:05:53,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:05:53,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:05:53,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:05:53,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:05:53,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:05:53,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... [2018-11-28 11:05:53,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:05:53,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:05:53,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:05:53,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:05:53,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:05:53,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:05:54,440 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:05:54,440 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 11:05:54,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:05:54 BoogieIcfgContainer [2018-11-28 11:05:54,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:05:54,441 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:05:54,441 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:05:54,443 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:05:54,444 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:05:54,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:05:53" (1/3) ... [2018-11-28 11:05:54,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@372183a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:05:54, skipping insertion in model container [2018-11-28 11:05:54,447 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:05:54,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:05:53" (2/3) ... [2018-11-28 11:05:54,448 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@372183a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:05:54, skipping insertion in model container [2018-11-28 11:05:54,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:05:54,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:05:54" (3/3) ... [2018-11-28 11:05:54,450 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label07_true-unreach-call_false-termination.c [2018-11-28 11:05:54,491 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:05:54,492 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:05:54,492 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:05:54,492 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:05:54,492 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:05:54,493 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:05:54,493 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:05:54,493 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:05:54,493 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:05:54,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 11:05:54,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 11:05:54,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:54,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:54,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:05:54,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:05:54,551 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:05:54,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 11:05:54,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 11:05:54,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:54,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:54,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:05:54,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:05:54,566 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-11-28 11:05:54,567 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-11-28 11:05:54,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:05:54,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:54,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:54,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:54,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-28 11:05:54,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:54,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:54,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:54,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:54,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:54,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:54,684 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-28 11:05:54,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:54,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:54,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:54,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:54,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:54,759 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-28 11:05:54,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:05:54,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:05:54,902 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-28 11:05:54,942 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:05:54,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:05:54,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:05:54,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:05:54,945 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:05:54,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:54,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:05:54,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:05:54,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 11:05:54,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:05:54,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:05:54,965 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-28 11:05:54,971 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-28 11:05:54,994 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-28 11:05:55,000 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-28 11:05:55,003 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-28 11:05:55,005 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-28 11:05:55,007 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-28 11:05:55,014 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-28 11:05:55,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:05:55,200 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,224 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:55,224 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:55,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:55,330 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,367 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:55,367 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:55,407 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,428 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:55,429 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,455 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:55,455 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:55,498 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:55,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:05:55,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:55,559 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:05:55,561 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:05:55,561 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:05:55,561 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:05:55,561 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:05:55,561 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:05:55,562 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:55,562 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:05:55,562 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:05:55,562 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 11:05:55,562 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:05:55,562 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:05:55,564 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-28 11:05:55,576 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-28 11:05:55,579 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-28 11:05:55,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:05:55,620 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-28 11:05:55,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:05:55,632 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-28 11:05:55,635 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-28 11:05:55,816 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:05:55,820 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:05:55,821 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-28 11:05:55,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:55,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,836 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-28 11:05:55,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:55,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,841 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-28 11:05:55,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,842 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:55,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:55,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,865 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-28 11:05:55,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:55,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,875 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-28 11:05:55,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:55,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,878 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-28 11:05:55,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:55,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,882 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-28 11:05:55,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:55,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,884 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-28 11:05:55,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,886 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:55,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:55,887 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:55,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,894 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:05:55,894 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-28 11:05:55,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,895 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,896 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:55,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,908 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-28 11:05:55,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,911 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,911 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:55,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,915 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-28 11:05:55,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,916 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:55,916 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,921 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 11:05:55,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,940 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-28 11:05:55,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,942 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,943 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:55,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,948 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-28 11:05:55,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,952 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:55,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,956 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-28 11:05:55,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,957 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:55,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,960 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-28 11:05:55,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,965 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:55,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,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-28 11:05:55,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,969 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:55,969 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:55,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:55,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,976 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:05:55,976 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-28 11:05:55,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,981 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:55,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:55,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,991 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-28 11:05:55,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:55,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:55,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:55,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:55,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:55,995 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-28 11:05:55,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:55,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:55,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:55,996 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:55,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,001 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:05:56,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,012 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-28 11:05:56,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,018 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,018 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,022 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-28 11:05:56,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,023 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,024 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:56,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,032 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,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-28 11:05:56,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,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-28 11:05:56,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,039 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:56,039 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,039 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:56,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,044 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:05:56,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-28 11:05:56,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,047 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,055 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-28 11:05:56,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,056 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,056 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,061 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-28 11:05:56,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,062 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:56,062 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,064 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 11:05:56,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,077 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-28 11:05:56,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,079 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,080 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,084 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-28 11:05:56,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,087 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,087 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:56,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,090 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,091 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:56,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,095 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:56,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:56,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,096 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:56,097 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,097 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:56,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,102 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:05:56,103 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-28 11:05:56,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,103 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,104 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,105 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:56,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,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-28 11:05:56,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,119 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,120 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,120 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:56,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,124 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-28 11:05:56,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,125 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,125 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:56,126 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,128 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 11:05:56,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:56,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,158 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:56,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,163 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-28 11:05:56,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,164 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,165 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:56,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,168 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-28 11:05:56,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,168 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,171 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,172 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:56,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,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-28 11:05:56,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,174 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,175 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,175 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:56,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,177 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-28 11:05:56,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,177 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,178 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:56,178 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:56,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:56,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,184 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:05:56,184 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-28 11:05:56,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,185 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,187 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,198 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-28 11:05:56,200 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,200 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,201 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,205 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-28 11:05:56,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,205 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,206 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:56,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,209 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:05:56,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,234 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-28 11:05:56,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,234 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,235 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,236 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,241 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-28 11:05:56,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,241 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,246 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-28 11:05:56,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,247 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,247 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,248 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,251 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-28 11:05:56,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,252 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,253 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,254 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-28 11:05:56,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,255 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:56,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,255 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:56,255 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,257 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:56,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,264 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:05:56,264 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-28 11:05:56,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,265 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,265 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,268 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,277 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-28 11:05:56,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,277 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,278 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,279 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,283 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-28 11:05:56,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,284 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,284 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:56,284 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,288 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 11:05:56,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:56,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,319 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,319 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,321 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,328 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-28 11:05:56,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,328 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,329 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,330 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,334 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-28 11:05:56,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,335 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,335 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,336 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,340 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-28 11:05:56,341 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,341 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,342 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,343 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:56,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,344 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-28 11:05:56,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,345 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,345 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:56,345 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:56,347 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:56,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,355 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:05:56,356 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-28 11:05:56,356 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,356 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,357 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,358 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,367 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-28 11:05:56,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,368 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,368 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,368 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,371 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-28 11:05:56,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,372 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,372 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:56,372 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,374 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:05:56,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,390 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-28 11:05:56,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,391 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,392 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,396 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-28 11:05:56,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,397 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,398 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,400 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-28 11:05:56,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,401 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,401 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,402 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,404 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-28 11:05:56,404 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,405 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,405 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,405 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:56,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:56,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,408 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:56,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,408 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:56,408 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:56,409 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:56,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,416 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:05:56,416 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-28 11:05:56,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,419 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,420 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:56,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,445 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-28 11:05:56,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,446 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,446 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:56,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,451 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-28 11:05:56,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,451 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,452 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 11:05:56,452 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,455 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 11:05:56,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,520 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-28 11:05:56,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,523 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,523 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:56,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,536 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-28 11:05:56,536 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,536 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,537 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:56,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,541 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-28 11:05:56,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,542 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,543 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:56,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,547 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-28 11:05:56,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,548 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:56,548 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:56,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,553 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-28 11:05:56,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:56,553 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:56,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:56,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:56,554 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:56,554 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:56,555 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:05:56,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:56,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:56,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:05:56,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:05:56,577 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-28 11:05:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:57,341 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-11-28 11:05:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:05:57,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-11-28 11:05:57,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 11:05:57,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-11-28 11:05:57,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-11-28 11:05:57,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-11-28 11:05:57,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-11-28 11:05:57,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:05:57,355 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-11-28 11:05:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-11-28 11:05:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-11-28 11:05:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-28 11:05:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-11-28 11:05:57,384 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 11:05:57,384 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 11:05:57,384 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:05:57,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-11-28 11:05:57,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-11-28 11:05:57,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:57,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:57,387 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:05:57,387 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:57,387 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-11-28 11:05:57,387 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-11-28 11:05:57,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 11:05:57,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:57,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:57,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:57,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:57,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-28 11:05:57,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:57,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:57,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:57,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:57,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:57,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-28 11:05:57,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:57,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:57,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:57,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:57,433 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-28 11:05:57,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:05:57,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 11:05:57,523 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:05:57,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:05:57,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:05:57,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:05:57,524 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:05:57,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:57,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:05:57,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:05:57,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 11:05:57,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:05:57,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:05:57,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:05:57,530 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-28 11:05:57,533 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-28 11:05:57,535 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-28 11:05:57,537 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-28 11:05:57,539 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-28 11:05:57,544 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-28 11:05:57,550 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-28 11:05:57,657 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:05:57,657 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:57,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:57,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:57,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:57,664 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:57,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:57,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:57,699 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:57,700 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/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-28 11:05:57,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:57,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:57,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:57,721 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:57,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:57,740 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:57,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:57,742 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:57,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:57,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:57,765 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:05:57,765 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:57,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:05:57,787 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:57,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:05:57,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:05:57,841 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:05:57,842 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:05:57,842 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:05:57,843 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:05:57,843 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:05:57,843 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:05:57,843 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:05:57,843 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:05:57,843 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:05:57,843 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 11:05:57,843 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:05:57,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:05:57,845 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-28 11:05:57,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:05:57,850 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-28 11:05:57,852 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-28 11:05:57,854 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-28 11:05:57,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:05:57,869 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-28 11:05:57,875 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-28 11:05:57,968 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:05:57,968 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:05:57,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-28 11:05:57,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:57,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,971 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-28 11:05:57,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,971 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:57,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:57,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,972 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-28 11:05:57,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:57,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,974 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-28 11:05:57,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:57,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,976 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-28 11:05:57,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,976 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:57,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:57,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,979 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-28 11:05:57,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,979 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:57,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,980 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:57,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,982 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-28 11:05:57,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:57,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:57,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:05:57,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:05:57,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,988 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:05:57,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:57,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,989 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:57,989 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:57,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,990 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-28 11:05:57,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,991 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:57,991 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:57,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:57,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,992 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-28 11:05:57,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,993 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:57,993 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:57,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,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-28 11:05:57,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:57,994 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:57,995 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:57,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:57,996 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-28 11:05:57,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:57,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:57,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:57,997 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:57,997 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:57,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:57,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:57,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,000 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-28 11:05:58,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,000 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,000 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,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-28 11:05:58,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,006 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:58,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,009 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-28 11:05:58,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,009 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,010 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:58,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,011 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:05:58,012 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-28 11:05:58,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,012 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,013 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,014 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-28 11:05:58,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,015 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,015 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,015 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,016 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-28 11:05:58,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,017 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,017 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,018 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-28 11:05:58,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,019 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,019 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,020 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-28 11:05:58,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,021 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,021 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,022 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,024 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-28 11:05:58,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,025 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,025 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,026 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,031 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-28 11:05:58,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,032 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,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-28 11:05:58,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,037 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,039 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:05:58,039 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-28 11:05:58,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,040 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,040 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,042 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-28 11:05:58,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,043 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,043 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,044 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:58,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,045 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-28 11:05:58,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,045 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,046 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,047 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-28 11:05:58,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,047 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,049 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-28 11:05:58,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,051 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:58,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,054 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-28 11:05:58,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,055 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,055 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,056 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:58,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,061 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-28 11:05:58,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,062 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,063 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,067 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-28 11:05:58,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:05:58,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,068 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,068 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,071 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:05:58,071 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-28 11:05:58,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,072 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,072 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,073 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:58,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,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-28 11:05:58,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,076 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,076 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,076 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,077 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-28 11:05:58,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,078 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,078 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,079 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:58,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:58,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,080 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,081 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,081 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:58,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,083 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-28 11:05:58,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,084 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,084 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:58,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,090 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,090 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,098 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-28 11:05:58,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,099 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,099 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,100 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:58,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,106 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-28 11:05:58,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,107 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,107 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:05:58,108 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:05:58,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,110 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:05:58,111 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-28 11:05:58,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,111 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,112 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,112 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:58,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,116 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,116 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,116 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,117 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:58,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,119 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:58,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,122 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,122 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,123 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,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-28 11:05:58,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,126 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,126 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,126 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,127 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,134 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-28 11:05:58,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,134 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,135 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,135 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,136 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,147 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-28 11:05:58,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,148 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,149 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,157 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-28 11:05:58,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,158 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:05:58,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,158 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,165 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:05:58,165 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-28 11:05:58,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,166 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,166 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,167 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,172 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-28 11:05:58,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,174 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,174 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,174 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,176 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:58,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,177 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-28 11:05:58,178 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,178 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,178 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,179 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,181 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-28 11:05:58,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,181 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,182 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,183 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,189 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-28 11:05:58,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,189 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,190 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,190 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,192 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:58,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,204 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-28 11:05:58,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,216 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,216 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,216 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,219 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 11:05:58,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:58,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,247 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,255 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,263 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-28 11:05:58,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,264 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,265 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:05:58,267 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:05:58,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,272 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:05:58,273 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-28 11:05:58,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,273 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,274 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,276 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-28 11:05:58,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,276 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,277 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,277 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,279 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-28 11:05:58,279 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,279 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,280 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,280 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,282 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-28 11:05:58,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,283 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,285 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-28 11:05:58,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,286 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,286 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,286 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,291 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-28 11:05:58,291 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,291 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,291 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,291 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,292 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:05:58,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,300 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-28 11:05:58,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,300 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,301 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,311 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-28 11:05:58,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,312 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:05:58,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,312 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:05:58,313 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:05:58,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,317 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:05:58,317 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-28 11:05:58,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,317 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,318 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:05:58,322 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,322 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,322 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,323 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,323 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:05:58,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,382 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-28 11:05:58,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,382 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,383 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,386 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-28 11:05:58,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,387 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,387 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,395 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-28 11:05:58,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,396 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,396 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,397 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:05:58,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,410 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-28 11:05:58,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,411 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:05:58,411 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,412 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 11:05:58,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,429 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-28 11:05:58,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,430 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,430 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,446 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-28 11:05:58,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:05:58,447 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:05:58,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:05:58,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:05:58,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:05:58,447 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:05:58,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:05:58,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:05:58,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:05:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:05:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:05:58,454 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-11-28 11:05:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:58,834 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-11-28 11:05:58,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:05:58,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-11-28 11:05:58,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 11:05:58,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 11:05:58,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-11-28 11:05:58,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-11-28 11:05:58,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-11-28 11:05:58,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:05:58,846 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 11:05:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-11-28 11:05:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-11-28 11:05:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-28 11:05:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 11:05:58,862 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 11:05:58,862 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 11:05:58,862 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:05:58,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-11-28 11:05:58,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 11:05:58,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:58,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:58,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:05:58,867 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:58,867 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-11-28 11:05:58,868 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-11-28 11:05:58,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 11:05:58,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:58,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:58,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:58,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:58,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:58,874 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-28 11:05:58,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:58,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:58,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:58,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:05:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:05:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:05:58,938 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:05:58,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:05:58,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:05:58,938 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-11-28 11:05:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:59,518 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-11-28 11:05:59,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:05:59,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-11-28 11:05:59,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-11-28 11:05:59,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-11-28 11:05:59,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-11-28 11:05:59,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-11-28 11:05:59,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-11-28 11:05:59,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:05:59,527 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-11-28 11:05:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-11-28 11:05:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-11-28 11:05:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-11-28 11:05:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-11-28 11:05:59,544 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 11:05:59,544 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 11:05:59,544 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:05:59,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-11-28 11:05:59,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-11-28 11:05:59,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:59,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:59,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:05:59,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:59,550 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-11-28 11:05:59,551 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-11-28 11:05:59,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-28 11:05:59,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:59,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:59,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:59,556 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-28 11:05:59,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:59,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:59,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:05:59,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:05:59,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:05:59,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:05:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:05:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:05:59,583 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-11-28 11:05:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:05:59,903 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-11-28 11:05:59,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:05:59,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-11-28 11:05:59,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:05:59,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 11:05:59,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-11-28 11:05:59,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-11-28 11:05:59,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-11-28 11:05:59,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:05:59,917 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 11:05:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-11-28 11:05:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-11-28 11:05:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-11-28 11:05:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 11:05:59,934 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 11:05:59,935 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 11:05:59,935 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:05:59,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-11-28 11:05:59,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:05:59,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:05:59,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:05:59,941 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:05:59,941 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:05:59,942 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-11-28 11:05:59,942 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-11-28 11:05:59,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:59,942 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-28 11:05:59,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:59,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:05:59,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:05:59,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:05:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-28 11:05:59,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:05:59,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:05:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:05:59,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:05:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:05:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:05:59,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:05:59,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:05:59,984 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:05:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:05:59,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:05:59,985 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-11-28 11:06:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:06:00,419 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-11-28 11:06:00,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:06:00,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-11-28 11:06:00,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:06:00,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 11:06:00,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-11-28 11:06:00,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-11-28 11:06:00,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-11-28 11:06:00,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:06:00,434 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 11:06:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-11-28 11:06:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-11-28 11:06:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-11-28 11:06:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 11:06:00,452 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 11:06:00,452 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 11:06:00,452 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:06:00,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-11-28 11:06:00,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 11:06:00,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:06:00,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:06:00,458 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:06:00,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:06:00,458 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-11-28 11:06:00,459 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-11-28 11:06:00,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-28 11:06:00,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:00,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:06:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:00,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-28 11:06:00,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:00,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:00,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:06:00,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:06:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:06:00,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:06:00,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:06:00,527 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:06:00,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:06:00,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:06:00,528 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-11-28 11:06:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:06:00,816 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-11-28 11:06:00,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:06:00,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-11-28 11:06:00,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 11:06:00,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 11:06:00,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-11-28 11:06:00,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-11-28 11:06:00,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-11-28 11:06:00,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:06:00,827 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 11:06:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-11-28 11:06:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-11-28 11:06:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-11-28 11:06:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 11:06:00,839 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 11:06:00,839 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 11:06:00,839 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:06:00,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-11-28 11:06:00,843 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 11:06:00,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:06:00,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:06:00,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:06:00,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:06:00,844 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-11-28 11:06:00,845 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-11-28 11:06:00,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:00,845 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-28 11:06:00,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:00,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:00,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:06:00,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:00,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-28 11:06:00,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:06:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:00,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:00,890 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-28 11:06:00,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:00,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:00,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:06:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:06:01,203 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-28 11:06:01,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:06:01,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:06:01,976 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-28 11:06:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:06:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:06:02,040 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-11-28 11:06:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:06:02,571 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-11-28 11:06:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:06:02,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-11-28 11:06:02,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 11:06:02,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-11-28 11:06:02,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-11-28 11:06:02,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-11-28 11:06:02,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-11-28 11:06:02,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:06:02,584 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 11:06:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-11-28 11:06:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-11-28 11:06:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-11-28 11:06:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-11-28 11:06:02,600 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 11:06:02,600 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 11:06:02,600 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:06:02,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-11-28 11:06:02,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 11:06:02,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:06:02,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:06:02,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:06:02,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:06:02,606 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-11-28 11:06:02,606 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-11-28 11:06:02,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-28 11:06:02,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:02,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:02,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:06:02,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:02,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-28 11:06:02,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:02,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:02,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:06:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:02,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:06:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-28 11:06:02,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:06:02,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:06:02,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:02,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:06:02,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:06:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:06:02,749 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-11-28 11:06:02,849 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:06:02,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:06:02,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:06:02,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:06:02,850 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:06:02,850 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:02,850 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:06:02,850 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:06:02,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label07_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-28 11:06:02,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:06:02,850 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:06:02,852 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-28 11:06:02,859 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-28 11:06:02,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:06:02,863 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-28 11:06:02,865 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-28 11:06:02,867 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-28 11:06:02,869 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-28 11:06:02,871 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-28 11:06:02,872 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-28 11:06:02,874 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-28 11:06:02,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:06:02,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:06:02,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:06:02,880 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-28 11:06:02,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:06:02,894 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-28 11:06:02,901 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-28 11:06:02,902 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-28 11:06:02,905 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-28 11:06:02,910 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-28 11:06:02,913 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-28 11:06:03,040 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:06:03,041 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,047 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,047 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,064 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,067 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,067 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,086 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,086 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,106 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,126 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,126 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,146 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,146 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,164 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,164 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,169 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,186 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,189 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,189 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,206 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,206 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,209 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,209 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,226 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,226 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,228 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,267 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,284 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,289 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,289 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,312 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,330 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,348 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:06:03,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,561 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,561 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,582 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,582 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,602 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,619 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:06:03,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,802 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:06:03,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:06:03,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:06:03,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:06:03,822 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-28 11:06:03,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:06:03 BoogieIcfgContainer [2018-11-28 11:06:03,860 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:06:03,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:06:03,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:06:03,860 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:06:03,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:05:54" (3/4) ... [2018-11-28 11:06:03,864 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 11:06:03,902 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7c5a3fde-27b4-482f-bf94-1f2737427271/bin-2019/uautomizer/witness.graphml [2018-11-28 11:06:03,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:06:03,903 INFO L168 Benchmark]: Toolchain (without parser) took 10744.37 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 470.8 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 337.2 MB. Max. memory is 11.5 GB. [2018-11-28 11:06:03,904 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:06:03,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:06:03,904 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:06:03,905 INFO L168 Benchmark]: Boogie Preprocessor took 40.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:06:03,905 INFO L168 Benchmark]: RCFGBuilder took 792.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.1 MB in the end (delta: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:06:03,905 INFO L168 Benchmark]: BuchiAutomizer took 9418.85 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 985.1 MB in the beginning and 1.1 GB in the end (delta: -98.4 MB). Peak memory consumption was 374.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:06:03,906 INFO L168 Benchmark]: Witness Printer took 42.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:06:03,908 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 393.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 792.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 985.1 MB in the end (delta: 105.3 MB). Peak memory consumption was 105.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9418.85 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 985.1 MB in the beginning and 1.1 GB in the end (delta: -98.4 MB). Peak memory consumption was 374.4 MB. Max. memory is 11.5 GB. * Witness Printer took 42.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.7s. Construction of modules took 2.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 68ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@725a1c2=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@133f6389=0, y=0, x=0, z=0, u=0, w=0, v=0, a=0, c=0, a28=0, \old(input)=0, output=0, a25=0, a21=0, d=0, e=0, f=0, input=0, input=0} State at position 1 is {a19=1, a17=8, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@725a1c2=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@133f6389=1, y=25, x=24, z=26, u=21, w=23, v=22, a=1, c=3, a28=10, \old(input)=6, output=-1, a25=0, a21=1, d=4, e=5, f=6, input=6, input=6} For i>1, the state at position i is {a19=1 + sum_{k=0}^i 0, a17=8 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@725a1c2=0 + sum_{k=0}^i 0, a11=0 + sum_{k=0}^i 0, \result=22 + sum_{k=0}^i -23*0^k, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@133f6389=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...