./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/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 e521cfa02db8c2eac8727300620f5ffec2ecc0c7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:40:03,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:40:03,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:40:03,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:40:03,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:40:03,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:40:03,096 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:40:03,098 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:40:03,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:40:03,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:40:03,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:40:03,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:40:03,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:40:03,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:40:03,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:40:03,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:40:03,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:40:03,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:40:03,106 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:40:03,107 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:40:03,108 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:40:03,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:40:03,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:40:03,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:40:03,111 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:40:03,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:40:03,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:40:03,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:40:03,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:40:03,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:40:03,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:40:03,115 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:40:03,115 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:40:03,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:40:03,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:40:03,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:40:03,116 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 04:40:03,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:40:03,124 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:40:03,125 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:40:03,125 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:40:03,125 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:40:03,126 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:40:03,126 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:40:03,126 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:40:03,126 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:40:03,126 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:40:03,126 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:40:03,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:40:03,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:40:03,127 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:40:03,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:40:03,127 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:40:03,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:40:03,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:40:03,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:40:03,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:40:03,128 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:40:03,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:40:03,128 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:40:03,128 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:40:03,129 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:40:03,129 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:40:03,129 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:40:03,129 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:40:03,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:40:03,129 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:40:03,129 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:40:03,130 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:40:03,130 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_59ce5ce6-5535-4c33-a145-d4726d085836/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 -> e521cfa02db8c2eac8727300620f5ffec2ecc0c7 [2018-11-23 04:40:03,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:40:03,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:40:03,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:40:03,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:40:03,165 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:40:03,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-23 04:40:03,205 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/data/23e310f5d/4c4aaf9a3b7e44d0a3d2ccd4d5f0958e/FLAGb9aea7f5b [2018-11-23 04:40:03,597 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:40:03,598 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/sv-benchmarks/c/eca-rers2012/Problem02_label00_true-unreach-call_false-termination.c [2018-11-23 04:40:03,608 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/data/23e310f5d/4c4aaf9a3b7e44d0a3d2ccd4d5f0958e/FLAGb9aea7f5b [2018-11-23 04:40:03,970 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/data/23e310f5d/4c4aaf9a3b7e44d0a3d2ccd4d5f0958e [2018-11-23 04:40:03,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:40:03,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:40:03,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:40:03,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:40:03,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:40:03,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:40:03" (1/1) ... [2018-11-23 04:40:03,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6663a739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:03, skipping insertion in model container [2018-11-23 04:40:03,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:40:03" (1/1) ... [2018-11-23 04:40:03,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:40:04,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:40:04,263 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:40:04,267 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:40:04,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:40:04,343 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:40:04,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04 WrapperNode [2018-11-23 04:40:04,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:40:04,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:40:04,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:40:04,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:40:04,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,453 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:40:04,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:40:04,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:40:04,453 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:40:04,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... [2018-11-23 04:40:04,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:40:04,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:40:04,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:40:04,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:40:04,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 04:40:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:40:04,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:40:05,408 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:40:05,409 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 04:40:05,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:05 BoogieIcfgContainer [2018-11-23 04:40:05,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:40:05,410 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:40:05,410 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:40:05,413 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:40:05,413 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:05,413 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:40:03" (1/3) ... [2018-11-23 04:40:05,414 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f7c513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:40:05, skipping insertion in model container [2018-11-23 04:40:05,414 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:05,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:04" (2/3) ... [2018-11-23 04:40:05,415 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f7c513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:40:05, skipping insertion in model container [2018-11-23 04:40:05,415 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:05,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:05" (3/3) ... [2018-11-23 04:40:05,417 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label00_true-unreach-call_false-termination.c [2018-11-23 04:40:05,455 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:40:05,456 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:40:05,456 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:40:05,456 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:40:05,456 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:40:05,456 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:40:05,457 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:40:05,457 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:40:05,457 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:40:05,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 04:40:05,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 04:40:05,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:05,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:05,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:05,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:40:05,503 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:40:05,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 04:40:05,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 04:40:05,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:05,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:05,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:05,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:40:05,515 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-23 04:40:05,516 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-23 04:40:05,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:05,520 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 04:40:05,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:05,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:05,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:05,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:05,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:05,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-23 04:40:05,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:05,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:05,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:05,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-23 04:40:05,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:05,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:05,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:05,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:40:05,790 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:05,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:05,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:05,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:05,792 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:40:05,792 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:05,792 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:05,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:05,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 04:40:05,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:05,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:05,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:05,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:05,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:05,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:05,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:05,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:05,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-23 04:40:05,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-23 04:40:06,025 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:06,026 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,043 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:06,043 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,075 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:06,075 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,097 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:06,097 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:06,121 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,149 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:06,152 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,185 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:06,185 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:06,215 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:06,234 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:06,258 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:06,289 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 04:40:06,290 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:06,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:06,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:06,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:06,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:40:06,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:06,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:06,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:06,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 04:40:06,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:06,292 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:06,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:06,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:06,528 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:40:06,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:06,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:06,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,545 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:06,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:06,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:06,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:06,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:06,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,577 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:06,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,581 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 04:40:06,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,584 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,591 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,592 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,595 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,597 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 04:40:06,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,613 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,617 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,618 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,621 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,621 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,625 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,626 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:06,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,632 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 04:40:06,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,634 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,642 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,646 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,647 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:06,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,666 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,675 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,675 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,675 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:06,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,680 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 04:40:06,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,681 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,682 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,689 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,689 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,693 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,693 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,695 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 04:40:06,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,708 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,709 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,714 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,714 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,717 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,717 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,720 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,721 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:06,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,723 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,723 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,723 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:06,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,727 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 04:40:06,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,742 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,743 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,746 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,746 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,746 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,748 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 04:40:06,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,778 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,784 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,785 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,792 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,792 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,793 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,793 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,796 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,799 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:06,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,801 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,801 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,801 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,801 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:06,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:06,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,806 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 04:40:06,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,807 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,821 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,826 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,826 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,826 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,829 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:06,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,850 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,850 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,851 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,856 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,856 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,857 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,861 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,861 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,862 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,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-23 04:40:06,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,865 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,866 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,866 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,868 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,868 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:06,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,868 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,870 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:06,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,876 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 04:40:06,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,877 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,877 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,878 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,880 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,887 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,887 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,887 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,888 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,893 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,893 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,893 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,897 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 04:40:06,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,923 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,923 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,925 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,931 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,932 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,933 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,937 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,942 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,942 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,942 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,943 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:06,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,944 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:06,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,945 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:06,947 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:06,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,953 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 04:40:06,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,954 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,955 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,962 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,963 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,963 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,965 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,966 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:06,966 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,967 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:06,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,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-23 04:40:06,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,980 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,980 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,981 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,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-23 04:40:06,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,985 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,986 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,986 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,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-23 04:40:06,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,988 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,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-23 04:40:06,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,991 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:06,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:06,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:06,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:06,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:06,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:06,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:06,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:06,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:06,994 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:06,995 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:06,995 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:06,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,001 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 04:40:07,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:07,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,002 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:07,002 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:07,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,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-23 04:40:07,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,025 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:07,025 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:07,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:07,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,029 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,029 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:40:07,029 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,032 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 04:40:07,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,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-23 04:40:07,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,083 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:07,084 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:07,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,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-23 04:40:07,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:07,094 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:07,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:07,101 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,101 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:07,102 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:07,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,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-23 04:40:07,106 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,106 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:07,107 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:07,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:07,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:07,111 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:07,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:07,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:07,111 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:07,111 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:07,113 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:07,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:07,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:07,132 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-23 04:40:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:07,687 INFO L93 Difference]: Finished difference Result 379 states and 545 transitions. [2018-11-23 04:40:07,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:07,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 545 transitions. [2018-11-23 04:40:07,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 369 [2018-11-23 04:40:07,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 371 states and 537 transitions. [2018-11-23 04:40:07,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 371 [2018-11-23 04:40:07,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2018-11-23 04:40:07,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 537 transitions. [2018-11-23 04:40:07,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:07,704 INFO L705 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 04:40:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 537 transitions. [2018-11-23 04:40:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2018-11-23 04:40:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-23 04:40:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 535 transitions. [2018-11-23 04:40:07,740 INFO L728 BuchiCegarLoop]: Abstraction has 370 states and 535 transitions. [2018-11-23 04:40:07,740 INFO L608 BuchiCegarLoop]: Abstraction has 370 states and 535 transitions. [2018-11-23 04:40:07,741 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:40:07,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 370 states and 535 transitions. [2018-11-23 04:40:07,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 368 [2018-11-23 04:40:07,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:07,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:07,744 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:07,744 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:07,745 INFO L794 eck$LassoCheckResult]: Stem: 751#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; 629#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 630#L606-2 [2018-11-23 04:40:07,745 INFO L796 eck$LassoCheckResult]: Loop: 630#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 958#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; 957#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); 956#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 955#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); 954#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 953#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); 952#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 951#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; 632#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 630#L606-2 [2018-11-23 04:40:07,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:07,745 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 04:40:07,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:07,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:07,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:07,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:07,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:07,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-23 04:40:07,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:07,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:07,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-23 04:40:07,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:07,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:07,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:07,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:40:07,884 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:07,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:07,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:07,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:07,884 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:40:07,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:07,884 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:07,884 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:07,884 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 04:40:07,884 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:07,884 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:07,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:07,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:07,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-23 04:40:07,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-23 04:40:07,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:07,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:07,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:07,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,033 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:08,033 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:08,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:08,037 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:08,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:08,039 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:08,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:08,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:08,065 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:08,065 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_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:08,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:08,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:08,089 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:08,089 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:08,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:08,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:08,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:08,121 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:08,141 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:08,141 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:08,143 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:08,143 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:08,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:08,161 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:08,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:08,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:08,200 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 04:40:08,201 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:08,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:08,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:08,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:08,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:40:08,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:08,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:08,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:08,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 04:40:08,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:08,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:08,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:08,327 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:08,328 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:40:08,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-23 04:40:08,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:08,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:08,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,332 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,340 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:08,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:08,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,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-23 04:40:08,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,345 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,345 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,347 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:08,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:08,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,352 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 04:40:08,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,353 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,353 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,355 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,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-23 04:40:08,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,357 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,357 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,359 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,360 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,362 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,362 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,364 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,364 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,369 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,369 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,371 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 04:40:08,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-23 04:40:08,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,372 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,372 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,374 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,376 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,377 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,380 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,380 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,382 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,382 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,385 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,385 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,386 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,391 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,393 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 04:40:08,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,394 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,394 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,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-23 04:40:08,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,396 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,397 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,399 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,399 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,400 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:08,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,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-23 04:40:08,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,401 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,401 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,403 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,403 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,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-23 04:40:08,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,405 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,405 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,405 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:08,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,409 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,409 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,409 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:08,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:08,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,415 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,416 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,419 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 04:40:08,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,420 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,420 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,423 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,423 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,423 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,427 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,427 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,427 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,429 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,429 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,429 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,430 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,431 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,431 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,431 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,433 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,434 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,434 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,438 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,438 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,439 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,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-23 04:40:08,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,446 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:40:08,447 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:40:08,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,450 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 04:40:08,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,450 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,454 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,454 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,454 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,455 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,459 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,459 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,459 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,460 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,461 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,462 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,462 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,462 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,464 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,464 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,464 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,465 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,467 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,467 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,468 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,469 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,474 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,475 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,475 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,476 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,487 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:40:08,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,489 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,494 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 04:40:08,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,495 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,496 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,497 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,501 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,502 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,503 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,510 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,510 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,510 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,511 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:08,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,513 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,514 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,515 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,516 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,517 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,518 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,522 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,523 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,523 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,525 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:08,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,534 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,534 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,534 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,537 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:40:08,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,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-23 04:40:08,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,553 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,554 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:40:08,556 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:40:08,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,564 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 04:40:08,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,564 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,567 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,568 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,571 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,572 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,572 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,574 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,624 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,625 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,629 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,632 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,632 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,632 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,637 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,639 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:08,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,646 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:40:08,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:40:08,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:40:08,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,652 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 04:40:08,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,653 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,657 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,664 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,664 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,664 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,665 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:08,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,667 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,671 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,671 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,674 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,675 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,675 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:08,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,683 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,683 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,683 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:40:08,684 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,685 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:40:08,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:40:08,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:40:08,704 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:40:08,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:08,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:08,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:08,704 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:40:08,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:08,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:08,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:08,725 INFO L87 Difference]: Start difference. First operand 370 states and 535 transitions. cyclomatic complexity: 166 Second operand 3 states. [2018-11-23 04:40:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:09,284 INFO L93 Difference]: Finished difference Result 655 states and 911 transitions. [2018-11-23 04:40:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:09,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 655 states and 911 transitions. [2018-11-23 04:40:09,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 653 [2018-11-23 04:40:09,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 655 states to 655 states and 911 transitions. [2018-11-23 04:40:09,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 655 [2018-11-23 04:40:09,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 655 [2018-11-23 04:40:09,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 655 states and 911 transitions. [2018-11-23 04:40:09,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:09,296 INFO L705 BuchiCegarLoop]: Abstraction has 655 states and 911 transitions. [2018-11-23 04:40:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states and 911 transitions. [2018-11-23 04:40:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2018-11-23 04:40:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-11-23 04:40:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 911 transitions. [2018-11-23 04:40:09,313 INFO L728 BuchiCegarLoop]: Abstraction has 655 states and 911 transitions. [2018-11-23 04:40:09,313 INFO L608 BuchiCegarLoop]: Abstraction has 655 states and 911 transitions. [2018-11-23 04:40:09,313 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:40:09,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 655 states and 911 transitions. [2018-11-23 04:40:09,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 653 [2018-11-23 04:40:09,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:09,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:09,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:09,318 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-23 04:40:09,318 INFO L794 eck$LassoCheckResult]: Stem: 1787#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; 1662#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1663#L606-2 [2018-11-23 04:40:09,318 INFO L796 eck$LassoCheckResult]: Loop: 1663#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1765#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; 1766#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); 1912#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; 1675#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2180#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2178#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; 2176#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); 2174#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2172#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); 2170#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2168#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); 2166#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2164#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)); 2162#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); 2160#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); 2158#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); 2155#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2153#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); 2151#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2149#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2147#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2145#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); 2143#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); 2141#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2139#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); 2137#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2135#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2133#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); 2131#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2129#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); 2127#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); 2125#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2123#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2121#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2118#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2116#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); 2114#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2112#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2110#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2108#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); 2106#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2104#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2102#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); 2100#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2098#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); 2096#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); 2094#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2092#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); 2090#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2088#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2086#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)); 2084#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); 2082#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; 1773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1663#L606-2 [2018-11-23 04:40:09,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 04:40:09,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:09,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:09,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-23 04:40:09,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:09,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:09,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:09,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:09,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:09,376 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-23 04:40:09,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:09,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:40:09,377 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:09,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:40:09,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:40:09,377 INFO L87 Difference]: Start difference. First operand 655 states and 911 transitions. cyclomatic complexity: 257 Second operand 4 states. [2018-11-23 04:40:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:10,030 INFO L93 Difference]: Finished difference Result 1219 states and 1688 transitions. [2018-11-23 04:40:10,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:40:10,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1219 states and 1688 transitions. [2018-11-23 04:40:10,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1215 [2018-11-23 04:40:10,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1219 states to 1219 states and 1688 transitions. [2018-11-23 04:40:10,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1219 [2018-11-23 04:40:10,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1219 [2018-11-23 04:40:10,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1219 states and 1688 transitions. [2018-11-23 04:40:10,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:10,045 INFO L705 BuchiCegarLoop]: Abstraction has 1219 states and 1688 transitions. [2018-11-23 04:40:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states and 1688 transitions. [2018-11-23 04:40:10,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1216. [2018-11-23 04:40:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-23 04:40:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1682 transitions. [2018-11-23 04:40:10,062 INFO L728 BuchiCegarLoop]: Abstraction has 1216 states and 1682 transitions. [2018-11-23 04:40:10,062 INFO L608 BuchiCegarLoop]: Abstraction has 1216 states and 1682 transitions. [2018-11-23 04:40:10,062 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:40:10,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1216 states and 1682 transitions. [2018-11-23 04:40:10,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1212 [2018-11-23 04:40:10,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:10,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:10,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:10,069 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-23 04:40:10,069 INFO L794 eck$LassoCheckResult]: Stem: 3672#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; 3542#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3543#L606-2 [2018-11-23 04:40:10,069 INFO L796 eck$LassoCheckResult]: Loop: 3543#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4459#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; 4457#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); 4455#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4453#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); 4451#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4449#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); 4289#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; 3728#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4267#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4265#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; 4263#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; 3692#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3789#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3651#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; 3652#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); 4144#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4143#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); 4141#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4139#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); 4137#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4135#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)); 4133#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); 4131#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); 4129#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); 4127#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4125#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); 4123#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4121#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4119#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4117#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); 4115#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); 4113#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4111#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); 4109#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4107#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4105#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); 4103#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4101#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); 4099#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); 4097#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4095#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4093#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4091#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4089#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); 4087#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4085#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4083#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4081#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); 4079#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4077#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4075#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); 4073#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4071#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); 4069#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); 4067#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4065#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); 4063#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4061#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4059#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)); 4057#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); 4054#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; 4055#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3543#L606-2 [2018-11-23 04:40:10,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:10,070 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 04:40:10,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:10,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:10,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:10,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-23 04:40:10,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:10,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:10,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:10,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:10,099 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-23 04:40:10,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:10,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:10,100 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:10,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:10,100 INFO L87 Difference]: Start difference. First operand 1216 states and 1682 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-23 04:40:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:10,464 INFO L93 Difference]: Finished difference Result 1498 states and 1989 transitions. [2018-11-23 04:40:10,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:10,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1498 states and 1989 transitions. [2018-11-23 04:40:10,470 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 04:40:10,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1498 states to 1498 states and 1989 transitions. [2018-11-23 04:40:10,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1498 [2018-11-23 04:40:10,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1498 [2018-11-23 04:40:10,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1498 states and 1989 transitions. [2018-11-23 04:40:10,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:10,476 INFO L705 BuchiCegarLoop]: Abstraction has 1498 states and 1989 transitions. [2018-11-23 04:40:10,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states and 1989 transitions. [2018-11-23 04:40:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1497. [2018-11-23 04:40:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-11-23 04:40:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1987 transitions. [2018-11-23 04:40:10,491 INFO L728 BuchiCegarLoop]: Abstraction has 1497 states and 1987 transitions. [2018-11-23 04:40:10,491 INFO L608 BuchiCegarLoop]: Abstraction has 1497 states and 1987 transitions. [2018-11-23 04:40:10,491 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 04:40:10,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1497 states and 1987 transitions. [2018-11-23 04:40:10,495 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1493 [2018-11-23 04:40:10,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:10,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:10,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:10,497 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-23 04:40:10,497 INFO L794 eck$LassoCheckResult]: Stem: 6383#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; 6262#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6263#L606-2 [2018-11-23 04:40:10,497 INFO L796 eck$LassoCheckResult]: Loop: 6263#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7256#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; 7255#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); 7254#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7252#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); 7250#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7247#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); 7246#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7245#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)); 7243#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); 7241#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); 7240#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); 7239#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7238#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); 7236#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7234#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7232#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7230#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; 6489#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6867#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6865#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; 6863#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; 6480#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6881#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6869#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; 6868#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); 6866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6864#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); 6862#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6860#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); 6858#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6856#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)); 6854#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); 6852#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); 6850#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); 6848#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6846#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); 6844#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6842#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6840#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6838#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); 6836#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); 6834#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6832#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); 6830#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6828#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6826#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); 6824#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6822#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); 6820#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); 6818#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6816#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6814#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6812#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6810#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); 6808#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6806#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6804#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6802#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); 6800#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6798#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6796#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); 6794#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6792#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); 6790#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); 6788#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6786#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); 6784#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6782#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6780#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)); 6778#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); 6775#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; 6776#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6263#L606-2 [2018-11-23 04:40:10,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:10,498 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-23 04:40:10,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:10,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:10,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:10,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:10,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-23 04:40:10,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:10,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:10,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:10,536 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-23 04:40:10,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:10,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:10,536 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:10,537 INFO L87 Difference]: Start difference. First operand 1497 states and 1987 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-23 04:40:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:10,863 INFO L93 Difference]: Finished difference Result 1496 states and 1810 transitions. [2018-11-23 04:40:10,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:10,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1810 transitions. [2018-11-23 04:40:10,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1493 [2018-11-23 04:40:10,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1810 transitions. [2018-11-23 04:40:10,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-23 04:40:10,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-23 04:40:10,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1810 transitions. [2018-11-23 04:40:10,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:10,875 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1810 transitions. [2018-11-23 04:40:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1810 transitions. [2018-11-23 04:40:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-23 04:40:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-23 04:40:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1810 transitions. [2018-11-23 04:40:10,887 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1810 transitions. [2018-11-23 04:40:10,887 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1810 transitions. [2018-11-23 04:40:10,887 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 04:40:10,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1810 transitions. [2018-11-23 04:40:10,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1493 [2018-11-23 04:40:10,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:10,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:10,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:10,893 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-23 04:40:10,893 INFO L794 eck$LassoCheckResult]: Stem: 9387#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; 9261#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9262#L606-2 [2018-11-23 04:40:10,894 INFO L796 eck$LassoCheckResult]: Loop: 9262#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10485#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; 10481#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); 10477#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10473#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); 10468#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10464#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); 10458#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10459#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)); 10456#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); 9265#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); 9266#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); 9521#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9404#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); 9405#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10728#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9388#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9389#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); 9825#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); 10098#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10093#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); 10087#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10082#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10075#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); 9989#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9987#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); 9984#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); 9980#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9717#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; 9611#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9712#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9710#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; 9708#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); 9706#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9704#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); 9702#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9700#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); 9698#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9696#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)); 9694#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); 9692#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); 9690#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); 9688#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9686#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); 9684#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9682#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9680#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9678#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); 9676#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); 9674#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9672#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); 9670#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9668#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9666#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); 9664#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9662#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); 9660#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); 9657#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9655#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9653#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9651#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9649#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); 9647#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9645#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9643#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9641#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); 9639#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9637#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9635#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); 9633#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9631#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); 9629#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); 9627#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9625#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); 9623#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9621#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9619#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)); 9617#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); 9614#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; 9615#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9262#L606-2 [2018-11-23 04:40:10,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:10,894 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-23 04:40:10,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:10,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:10,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-23 04:40:10,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:10,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:10,960 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-23 04:40:10,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:10,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:10,961 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:40:10,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:10,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:10,961 INFO L87 Difference]: Start difference. First operand 1496 states and 1810 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-23 04:40:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:11,158 INFO L93 Difference]: Finished difference Result 1485 states and 1766 transitions. [2018-11-23 04:40:11,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:11,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1485 states and 1766 transitions. [2018-11-23 04:40:11,163 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1482 [2018-11-23 04:40:11,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1485 states to 1485 states and 1766 transitions. [2018-11-23 04:40:11,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1485 [2018-11-23 04:40:11,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1485 [2018-11-23 04:40:11,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1485 states and 1766 transitions. [2018-11-23 04:40:11,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:11,169 INFO L705 BuchiCegarLoop]: Abstraction has 1485 states and 1766 transitions. [2018-11-23 04:40:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states and 1766 transitions. [2018-11-23 04:40:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1485. [2018-11-23 04:40:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1485 states. [2018-11-23 04:40:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1766 transitions. [2018-11-23 04:40:11,181 INFO L728 BuchiCegarLoop]: Abstraction has 1485 states and 1766 transitions. [2018-11-23 04:40:11,181 INFO L608 BuchiCegarLoop]: Abstraction has 1485 states and 1766 transitions. [2018-11-23 04:40:11,181 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 04:40:11,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1485 states and 1766 transitions. [2018-11-23 04:40:11,186 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1482 [2018-11-23 04:40:11,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:11,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:11,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:11,187 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-23 04:40:11,187 INFO L794 eck$LassoCheckResult]: Stem: 12368#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; 12248#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12249#L606-2 [2018-11-23 04:40:11,188 INFO L796 eck$LassoCheckResult]: Loop: 12249#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 12991#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; 12989#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); 12987#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 12985#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); 12983#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12981#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); 12979#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 12977#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)); 12975#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); 12973#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); 12971#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); 12969#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12967#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); 12965#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12963#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12961#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12959#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); 12957#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); 12955#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12953#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); 12951#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12949#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12947#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); 12945#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12943#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); 12941#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); 12939#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12788#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12789#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13704#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13703#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); 13702#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13701#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13700#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13698#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); 13690#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13689#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13688#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); 13686#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13684#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); 13683#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); 13682#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13681#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); 13589#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12794#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12795#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)); 13593#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); 13591#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); 12868#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 12856#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); 12855#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12853#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 12851#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); 12850#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); 12849#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 12847#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 12845#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); 12843#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 12842#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); 12840#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); 12839#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12838#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)); 12836#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 12835#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); 12833#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 12832#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)); 12831#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 12829#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 12828#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12826#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)); 12824#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12822#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)); 12820#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12818#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12816#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12814#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); 12812#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12811#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12810#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12808#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12806#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12805#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12803#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12801#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12799#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12265#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13100#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13098#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13094#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13093#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13091#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13089#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13087#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13085#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13083#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12463#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13080#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13078#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13076#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13074#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13072#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13069#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13067#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13065#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13063#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13061#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13059#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13057#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13055#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13053#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13051#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13049#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13047#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13045#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13043#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13041#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13039#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13037#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13035#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13033#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13031#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13029#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13027#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13025#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13023#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13021#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13019#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13017#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13015#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13013#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13011#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13009#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13007#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13005#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13003#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13001#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12998#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12996#L594-1 calculate_output_#res := -2; 12994#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12249#L606-2 [2018-11-23 04:40:11,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-23 04:40:11,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:11,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:11,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:11,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-23 04:40:11,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:11,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:11,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:11,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-23 04:40:11,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:11,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:11,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 04:40:12,234 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-23 04:40:12,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:40:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:40:12,313 INFO L87 Difference]: Start difference. First operand 1485 states and 1766 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-23 04:40:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:13,088 INFO L93 Difference]: Finished difference Result 1676 states and 1955 transitions. [2018-11-23 04:40:13,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:40:13,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1676 states and 1955 transitions. [2018-11-23 04:40:13,093 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1621 [2018-11-23 04:40:13,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1676 states to 1676 states and 1955 transitions. [2018-11-23 04:40:13,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1676 [2018-11-23 04:40:13,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1676 [2018-11-23 04:40:13,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1676 states and 1955 transitions. [2018-11-23 04:40:13,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:13,103 INFO L705 BuchiCegarLoop]: Abstraction has 1676 states and 1955 transitions. [2018-11-23 04:40:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states and 1955 transitions. [2018-11-23 04:40:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1535. [2018-11-23 04:40:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-23 04:40:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1814 transitions. [2018-11-23 04:40:13,123 INFO L728 BuchiCegarLoop]: Abstraction has 1535 states and 1814 transitions. [2018-11-23 04:40:13,123 INFO L608 BuchiCegarLoop]: Abstraction has 1535 states and 1814 transitions. [2018-11-23 04:40:13,123 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 04:40:13,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1535 states and 1814 transitions. [2018-11-23 04:40:13,128 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1480 [2018-11-23 04:40:13,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:13,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:13,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:40:13,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:13,130 INFO L794 eck$LassoCheckResult]: Stem: 15552#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; 15434#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15435#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16204#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; 16202#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); 16200#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; 15693#L597 [2018-11-23 04:40:13,130 INFO L796 eck$LassoCheckResult]: Loop: 15693#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16223#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16218#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; 16217#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); 16215#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16213#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); 16211#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16209#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; 15693#L597 [2018-11-23 04:40:13,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-23 04:40:13,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:13,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:13,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:13,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:13,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-23 04:40:13,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:13,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:13,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:13,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-23 04:40:13,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:13,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:13,332 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:13,332 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:13,332 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:13,332 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:13,332 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:40:13,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:13,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:13,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:13,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label00_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-23 04:40:13,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:13,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:40:13,510 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:13,510 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,515 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,530 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,532 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,532 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,549 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,551 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,568 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,568 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,586 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,602 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,620 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,620 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,635 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,635 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,638 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,654 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,657 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,657 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,676 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,676 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,697 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,716 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,733 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,737 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,737 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,757 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,758 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,776 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:13,792 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:13,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:13,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:13,986 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:13,986 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:14,003 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:14,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:14,006 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:14,006 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:14,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:14,023 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:14,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:14,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:14,186 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:14,186 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:14,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:14,203 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:14,205 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:14,205 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:14,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:14,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:14,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:14,223 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_59ce5ce6-5535-4c33-a145-d4726d085836/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-23 04:40:14,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:14,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:14,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:40:14,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- [2018-11-23 04:40:14,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:40:14 BoogieIcfgContainer [2018-11-23 04:40:14,304 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 04:40:14,304 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:40:14,304 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:40:14,304 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:40:14,305 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:05" (3/4) ... [2018-11-23 04:40:14,307 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- [2018-11-23 04:40:14,353 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_59ce5ce6-5535-4c33-a145-d4726d085836/bin-2019/uautomizer/witness.graphml [2018-11-23 04:40:14,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:40:14,353 INFO L168 Benchmark]: Toolchain (without parser) took 10379.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 505.4 MB). Free memory was 956.4 MB in the beginning and 1.5 GB in the end (delta: -521.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:40:14,354 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:40:14,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 921.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:40:14,354 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 921.5 MB in the beginning and 1.1 GB in the end (delta: -210.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:40:14,355 INFO L168 Benchmark]: Boogie Preprocessor took 42.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:40:14,355 INFO L168 Benchmark]: RCFGBuilder took 913.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:40:14,355 INFO L168 Benchmark]: BuchiAutomizer took 8893.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.0 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -455.6 MB). Peak memory consumption was 541.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:40:14,355 INFO L168 Benchmark]: Witness Printer took 48.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 319.8 kB). Peak memory consumption was 319.8 kB. Max. memory is 11.5 GB. [2018-11-23 04:40:14,358 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 921.5 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 921.5 MB in the beginning and 1.1 GB in the end (delta: -210.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 913.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 103.9 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8893.52 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.0 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -455.6 MB). Peak memory consumption was 541.5 MB. Max. memory is 11.5 GB. * Witness Printer took 48.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 319.8 kB). Peak memory consumption was 319.8 kB. 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 1535 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.0s. Construction of modules took 2.5s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 146 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1535 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1458 SDtfs, 3067 SDslu, 479 SDs, 0 SdLazy, 3702 SolverSat, 846 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s 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: 53ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - 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@260715c3=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d19b03b=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@260715c3=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d19b03b=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@260715c3=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@d19b03b=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 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~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; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] 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; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [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; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] 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; [?] 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); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] 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); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] 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; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] 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); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] 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); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] 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; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(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) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(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) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((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 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [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; ----- 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...