./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label32_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_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label32_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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 3c0664b7713eb65e7600fbc10e17bb0e628a6c66 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:26:08,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:26:08,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:26:08,514 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:26:08,514 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:26:08,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:26:08,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:26:08,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:26:08,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:26:08,518 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:26:08,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:26:08,519 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:26:08,520 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:26:08,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:26:08,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:26:08,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:26:08,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:26:08,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:26:08,524 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:26:08,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:26:08,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:26:08,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:26:08,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:26:08,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:26:08,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:26:08,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:26:08,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:26:08,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:26:08,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:26:08,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:26:08,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:26:08,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:26:08,533 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:26:08,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:26:08,534 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:26:08,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:26:08,534 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 04:26:08,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:26:08,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:26:08,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:26:08,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:26:08,546 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:26:08,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:26:08,546 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:26:08,546 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:26:08,546 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:26:08,546 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:26:08,546 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:26:08,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:26:08,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:26:08,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:26:08,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:26:08,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:26:08,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:26:08,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:26:08,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:26:08,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:26:08,548 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:26:08,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:26:08,548 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:26:08,548 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:26:08,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:26:08,548 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:26:08,548 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:26:08,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:26:08,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:26:08,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:26:08,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:26:08,550 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:26:08,550 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_118ee576-4868-4e96-bd2c-00866912bde5/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 -> 3c0664b7713eb65e7600fbc10e17bb0e628a6c66 [2018-11-23 04:26:08,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:26:08,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:26:08,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:26:08,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:26:08,582 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:26:08,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label32_true-unreach-call_false-termination.c [2018-11-23 04:26:08,628 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/data/04dbdd6c9/19b8b3ba4af944709b13a9a3fe695fca/FLAG31cbec5f8 [2018-11-23 04:26:09,067 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:26:09,068 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/sv-benchmarks/c/eca-rers2012/Problem02_label32_true-unreach-call_false-termination.c [2018-11-23 04:26:09,076 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/data/04dbdd6c9/19b8b3ba4af944709b13a9a3fe695fca/FLAG31cbec5f8 [2018-11-23 04:26:09,088 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/data/04dbdd6c9/19b8b3ba4af944709b13a9a3fe695fca [2018-11-23 04:26:09,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:26:09,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:26:09,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:26:09,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:26:09,096 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:26:09,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277df2b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09, skipping insertion in model container [2018-11-23 04:26:09,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:26:09,142 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:26:09,409 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:26:09,413 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:26:09,483 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:26:09,493 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:26:09,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09 WrapperNode [2018-11-23 04:26:09,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:26:09,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:26:09,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:26:09,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:26:09,543 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:26:09" (1/1) ... [2018-11-23 04:26:09,555 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:26:09" (1/1) ... [2018-11-23 04:26:09,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:26:09,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:26:09,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:26:09,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:26:09,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... [2018-11-23 04:26:09,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:26:09,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:26:09,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:26:09,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:26:09,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 04:26:09,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:26:09,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:26:10,526 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:26:10,526 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 04:26:10,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:26:10 BoogieIcfgContainer [2018-11-23 04:26:10,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:26:10,527 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:26:10,527 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:26:10,529 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:26:10,530 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:26:10,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:26:09" (1/3) ... [2018-11-23 04:26:10,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d1f806e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:26:10, skipping insertion in model container [2018-11-23 04:26:10,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:26:10,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:26:09" (2/3) ... [2018-11-23 04:26:10,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d1f806e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:26:10, skipping insertion in model container [2018-11-23 04:26:10,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:26:10,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:26:10" (3/3) ... [2018-11-23 04:26:10,533 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label32_true-unreach-call_false-termination.c [2018-11-23 04:26:10,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:26:10,564 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:26:10,564 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:26:10,564 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:26:10,565 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:26:10,565 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:26:10,565 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:26:10,565 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:26:10,565 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:26:10,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 04:26:10,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 04:26:10,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:10,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:10,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:10,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:26:10,607 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:26:10,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 04:26:10,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 04:26:10,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:10,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:10,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:10,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:26:10,617 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:26:10,617 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:26:10,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 04:26:10,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:10,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:10,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:10,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:10,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:10,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:10,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-23 04:26:10,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:10,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:10,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:10,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:10,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:10,712 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-23 04:26:10,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:10,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:10,771 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:26:10,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:10,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:26:10,883 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:26:10,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:26:10,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:26:10,884 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:26:10,884 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:26:10,884 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:26:10,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:26:10,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:26:10,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 04:26:10,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:26:10,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:26:10,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:10,906 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:26:10,927 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:26:10,929 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:26:10,934 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:26:10,936 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:26:10,937 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:26:10,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:11,117 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:26:11,118 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,121 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:11,128 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,149 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:11,150 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,165 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,170 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:11,170 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,186 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,189 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:11,190 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:11,215 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,242 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:11,243 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,274 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,279 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:11,279 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:11,304 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:11,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:26:11,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:11,373 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 04:26:11,375 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:26:11,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:26:11,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:26:11,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:26:11,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:26:11,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:26:11,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:26:11,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:26:11,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 04:26:11,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:26:11,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:26:11,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:26:11,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:11,393 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:26:11,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:11,438 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:26:11,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:11,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:11,447 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:26:11,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:26:11,635 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:26:11,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:11,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:11,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:11,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,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:26:11,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,653 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:11,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:11,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,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:26:11,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:11,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:11,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,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:26:11,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:11,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:11,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:11,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:11,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,690 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:11,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:11,690 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,695 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 04:26:11,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,696 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,697 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,705 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,706 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,710 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:11,710 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,712 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 04:26:11,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,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:26:11,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,729 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,734 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,756 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,757 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,762 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:11,764 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:11,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,768 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 04:26:11,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,781 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:11,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,782 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:26:11,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,798 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,803 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,806 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,807 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,809 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,810 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:11,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:11,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,816 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 04:26:11,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,817 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,818 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:11,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,825 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,826 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:11,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,829 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:11,829 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,831 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 04:26:11,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,845 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,846 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:11,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:11,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,851 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,851 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:11,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,854 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,854 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:11,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,857 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,857 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:11,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:11,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,859 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:11,859 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:11,860 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:11,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,864 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 04:26:11,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:26:11,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,866 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,866 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,867 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,879 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,880 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,880 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,883 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,884 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:11,884 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,886 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 04:26:11,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,907 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,908 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,909 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,912 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,913 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,913 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,913 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,918 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,918 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,919 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,919 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,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:26:11,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,922 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,923 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,923 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:11,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,924 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:11,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,925 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:11,925 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:11,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:11,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,937 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 04:26:11,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,938 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,940 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,951 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,951 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,952 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,955 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,955 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:11,955 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,958 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:26:11,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:11,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,978 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,978 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,979 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,985 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,986 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,989 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,990 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:11,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,994 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:11,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:11,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:11,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:11,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:11,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:11,996 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:11,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:11,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:11,996 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:11,996 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:11,997 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:11,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,005 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 04:26:12,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,006 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,006 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,008 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:12,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,019 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,020 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:12,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,025 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,025 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:12,025 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,030 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 04:26:12,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,063 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,064 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:12,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,070 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,071 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,072 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:12,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,077 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,077 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,078 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:12,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,082 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,083 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,083 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:12,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,085 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,085 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:12,085 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:12,087 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:12,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,097 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 04:26:12,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,097 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,098 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,099 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:12,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,108 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:12,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,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:26:12,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,111 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,111 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:12,111 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,112 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:26:12,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,127 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,128 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,128 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:12,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,132 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:12,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,135 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,136 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,136 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:12,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,138 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,139 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,139 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:12,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,141 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:12,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:12,141 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:12,141 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:12,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,146 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 04:26:12,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,147 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,147 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:12,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,171 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,171 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:12,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,175 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,175 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 04:26:12,175 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,178 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 04:26:12,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,234 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,234 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:12,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,244 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:12,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:12,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,248 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,248 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:12,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,251 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,251 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:12,252 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:12,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:12,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:12,255 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:12,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:12,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:12,255 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:12,255 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:12,256 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:26:12,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:12,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:26:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:26:12,278 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-23 04:26:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:13,040 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2018-11-23 04:26:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:26:13,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 546 transitions. [2018-11-23 04:26:13,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 370 [2018-11-23 04:26:13,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 372 states and 539 transitions. [2018-11-23 04:26:13,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-23 04:26:13,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-23 04:26:13,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 539 transitions. [2018-11-23 04:26:13,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:26:13,051 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 539 transitions. [2018-11-23 04:26:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 539 transitions. [2018-11-23 04:26:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-23 04:26:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-23 04:26:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 537 transitions. [2018-11-23 04:26:13,079 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 04:26:13,079 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 04:26:13,079 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:26:13,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 537 transitions. [2018-11-23 04:26:13,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 369 [2018-11-23 04:26:13,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:13,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:13,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:13,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:26:13,082 INFO L794 eck$LassoCheckResult]: Stem: 745#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; 628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 629#L606-2 [2018-11-23 04:26:13,082 INFO L796 eck$LassoCheckResult]: Loop: 629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 727#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; 728#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); 871#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 754#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); 689#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 690#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); 842#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 630#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; 631#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 629#L606-2 [2018-11-23 04:26:13,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:13,082 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 04:26:13,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:13,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:13,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:13,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-23 04:26:13,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:13,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:13,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:26:13,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:13,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:13,102 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-23 04:26:13,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:13,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:13,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:26:13,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:13,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 04:26:13,231 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:26:13,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:26:13,232 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:26:13,232 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:26:13,232 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:26:13,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:26:13,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:26:13,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:26:13,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 04:26:13,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:26:13,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:26:13,234 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:26:13,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:26:13,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:26:13,243 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:26:13,244 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:26:13,246 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:26:13,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:26:13,255 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:26:13,357 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:26:13,357 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:13,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:13,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:13,369 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:13,369 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:13,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:13,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:13,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:13,394 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:13,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:13,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:13,420 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:13,420 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:13,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:13,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:13,448 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:13,448 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:13,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:13,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:13,478 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:13,478 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:13,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:13,504 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:13,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:26:13,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:13,544 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 04:26:13,546 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:26:13,546 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:26:13,546 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:26:13,546 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:26:13,546 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:26:13,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:26:13,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:26:13,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:26:13,547 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 04:26:13,547 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:26:13,547 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:26:13,548 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:26:13,551 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:26:13,571 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:26:13,572 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:26:13,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:13,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:13,587 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:26:13,710 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:26:13,711 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:26:13,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:13,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:13,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,716 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,716 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:13,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:13,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,719 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,719 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,720 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:26:13,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:26:13,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,729 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 04:26:13,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,730 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,732 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,732 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,742 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:13,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,743 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,744 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,745 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,747 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,747 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:13,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,750 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:13,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,755 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,755 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,757 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 04:26:13,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,758 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,764 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,766 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,767 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,768 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,768 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,771 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,771 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,778 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,779 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,783 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,784 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,786 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 04:26:13,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,787 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,787 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,796 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,799 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,799 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,800 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:13,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,801 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,802 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,803 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,803 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,807 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,807 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,807 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:13,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,810 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,810 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,811 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:13,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:26:13,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,823 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,824 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,827 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 04:26:13,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,828 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,828 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,828 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,832 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,833 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,833 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,836 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,837 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,837 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:13,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,839 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,839 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,839 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,840 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,842 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,842 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,842 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,844 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,845 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,845 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:13,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,850 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,850 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,850 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:13,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,857 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,858 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 04:26:13,858 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 04:26:13,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,861 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 04:26:13,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,862 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,862 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,863 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,866 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,866 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,872 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,873 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,873 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,875 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,875 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,875 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,876 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,878 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,882 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,882 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,882 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,883 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,889 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,889 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,891 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,904 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 04:26:13,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,910 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 04:26:13,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,911 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,911 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,912 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,917 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,918 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,926 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,926 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,927 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:13,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,929 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,930 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,930 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,940 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,945 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,945 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,946 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:13,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,956 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,956 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,957 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,958 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 04:26:13,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,973 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:13,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 04:26:13,975 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 04:26:13,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,981 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 04:26:13,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,982 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,982 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,983 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,983 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,985 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,985 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,986 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,989 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,989 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,990 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,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:26:13,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,991 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:13,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:13,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,994 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:13,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:13,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:13,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:13,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:13,996 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:13,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:13,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:13,997 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:13,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:13,997 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:13,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,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:26:14,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:14,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,002 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:14,002 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:14,003 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:26:14,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:14,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,009 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 04:26:14,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:14,009 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 04:26:14,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:26:14,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,014 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 04:26:14,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:14,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,015 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:14,015 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:14,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:14,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:14,019 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:14,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:14,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,025 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,025 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:14,025 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,026 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:26:14,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,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:26:14,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,028 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:14,028 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:14,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:14,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,031 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:14,032 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:14,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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:26:14,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,035 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,035 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:14,035 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,036 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:26:14,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:14,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,044 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,044 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:26:14,044 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,046 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 04:26:14,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:26:14,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 04:26:14,065 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 04:26:14,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:26:14,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:26:14,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:26:14,066 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 04:26:14,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:26:14,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:26:14,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:26:14,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:26:14,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:26:14,085 INFO L87 Difference]: Start difference. First operand 371 states and 537 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-23 04:26:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:14,527 INFO L93 Difference]: Finished difference Result 656 states and 915 transitions. [2018-11-23 04:26:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:26:14,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 915 transitions. [2018-11-23 04:26:14,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 04:26:14,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 915 transitions. [2018-11-23 04:26:14,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 656 [2018-11-23 04:26:14,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 656 [2018-11-23 04:26:14,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 915 transitions. [2018-11-23 04:26:14,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:26:14,539 INFO L705 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-23 04:26:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 915 transitions. [2018-11-23 04:26:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2018-11-23 04:26:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-23 04:26:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 915 transitions. [2018-11-23 04:26:14,557 INFO L728 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-23 04:26:14,557 INFO L608 BuchiCegarLoop]: Abstraction has 656 states and 915 transitions. [2018-11-23 04:26:14,557 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:26:14,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 656 states and 915 transitions. [2018-11-23 04:26:14,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 04:26:14,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:14,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:14,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:14,562 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:26:14,562 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; 1664#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1665#L606-2 [2018-11-23 04:26:14,563 INFO L796 eck$LassoCheckResult]: Loop: 1665#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1768#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; 1769#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); 1916#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; 1677#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2133#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2131#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; 2129#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); 2127#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2125#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); 2124#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2122#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); 2120#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2118#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)); 2116#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); 2114#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); 2112#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); 2111#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2109#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); 2107#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2105#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2103#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2101#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); 2099#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); 2097#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2095#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); 2093#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2091#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2089#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); 2087#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2085#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); 2082#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); 2081#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2080#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2079#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2078#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2077#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); 2075#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2072#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2070#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2068#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); 2066#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2065#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2063#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); 2061#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2060#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); 2059#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); 2058#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2056#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); 2054#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2052#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2050#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)); 2048#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); 2046#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; 1809#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1665#L606-2 [2018-11-23 04:26:14,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 04:26:14,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:14,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:14,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:14,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:14,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:14,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:14,571 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-23 04:26:14,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:14,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:14,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:14,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:26:14,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:14,633 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:26:14,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:14,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:26:14,634 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:26:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:26:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:26:14,634 INFO L87 Difference]: Start difference. First operand 656 states and 915 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-23 04:26:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:15,401 INFO L93 Difference]: Finished difference Result 1220 states and 1693 transitions. [2018-11-23 04:26:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:26:15,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 1693 transitions. [2018-11-23 04:26:15,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1216 [2018-11-23 04:26:15,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1220 states and 1693 transitions. [2018-11-23 04:26:15,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1220 [2018-11-23 04:26:15,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1220 [2018-11-23 04:26:15,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1220 states and 1693 transitions. [2018-11-23 04:26:15,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:26:15,415 INFO L705 BuchiCegarLoop]: Abstraction has 1220 states and 1693 transitions. [2018-11-23 04:26:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states and 1693 transitions. [2018-11-23 04:26:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2018-11-23 04:26:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-11-23 04:26:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2018-11-23 04:26:15,434 INFO L728 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-23 04:26:15,434 INFO L608 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-23 04:26:15,434 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:26:15,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1217 states and 1687 transitions. [2018-11-23 04:26:15,479 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1213 [2018-11-23 04:26:15,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:15,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:15,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:15,481 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:26:15,481 INFO L794 eck$LassoCheckResult]: Stem: 3668#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; 3546#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3547#L606-2 [2018-11-23 04:26:15,481 INFO L796 eck$LassoCheckResult]: Loop: 3547#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3647#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; 3648#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); 3813#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3677#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); 3606#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3607#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); 4463#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; 4445#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4443#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; 4441#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; 3660#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4700#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4699#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; 4161#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); 4150#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4149#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); 4147#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4145#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); 4143#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4141#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)); 4139#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); 4137#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); 4135#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); 4133#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4131#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); 4129#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4127#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4125#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4123#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); 4121#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); 4119#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4117#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); 4115#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4113#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4111#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); 4109#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4107#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); 4105#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); 4103#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4101#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4099#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4097#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4095#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); 4093#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4091#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4089#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4087#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); 4085#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4083#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4081#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); 4079#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4077#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); 4075#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); 4073#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4071#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); 4069#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4067#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4065#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)); 4063#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); 4061#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; 3693#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3547#L606-2 [2018-11-23 04:26:15,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:15,482 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 04:26:15,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:15,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:15,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:15,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:15,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-23 04:26:15,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:26:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:15,519 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:26:15,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:15,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:26:15,519 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:26:15,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:26:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:26:15,520 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-23 04:26:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:15,864 INFO L93 Difference]: Finished difference Result 1499 states and 1994 transitions. [2018-11-23 04:26:15,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:26:15,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1499 states and 1994 transitions. [2018-11-23 04:26:15,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1495 [2018-11-23 04:26:15,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1499 states to 1499 states and 1994 transitions. [2018-11-23 04:26:15,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1499 [2018-11-23 04:26:15,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1499 [2018-11-23 04:26:15,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1499 states and 1994 transitions. [2018-11-23 04:26:15,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:26:15,877 INFO L705 BuchiCegarLoop]: Abstraction has 1499 states and 1994 transitions. [2018-11-23 04:26:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states and 1994 transitions. [2018-11-23 04:26:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1498. [2018-11-23 04:26:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2018-11-23 04:26:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1992 transitions. [2018-11-23 04:26:15,890 INFO L728 BuchiCegarLoop]: Abstraction has 1498 states and 1992 transitions. [2018-11-23 04:26:15,890 INFO L608 BuchiCegarLoop]: Abstraction has 1498 states and 1992 transitions. [2018-11-23 04:26:15,890 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 04:26:15,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1498 states and 1992 transitions. [2018-11-23 04:26:15,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 04:26:15,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:15,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:15,895 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:15,895 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:26:15,896 INFO L794 eck$LassoCheckResult]: Stem: 6389#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; 6268#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6269#L606-2 [2018-11-23 04:26:15,896 INFO L796 eck$LassoCheckResult]: Loop: 6269#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7560#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; 7558#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); 7556#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7554#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); 7552#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7550#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); 7548#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7546#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)); 7544#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); 7542#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); 7540#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); 7538#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7536#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); 7534#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7532#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7530#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7528#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; 6497#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6874#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6872#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; 6870#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; 6410#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6876#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6875#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; 6873#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); 6871#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6869#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); 6867#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6865#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); 6863#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6861#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)); 6859#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); 6857#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); 6855#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); 6853#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6851#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); 6849#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6847#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6845#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6843#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); 6841#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); 6839#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6837#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); 6835#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6833#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6831#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); 6829#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6827#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); 6825#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); 6823#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6821#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6819#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6817#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6815#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); 6813#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6811#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6809#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6807#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); 6805#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6803#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6801#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); 6799#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6797#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); 6795#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); 6793#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6791#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); 6789#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6787#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6785#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)); 6783#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); 6779#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; 6780#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6269#L606-2 [2018-11-23 04:26:15,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-23 04:26:15,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:15,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:15,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-23 04:26:15,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:15,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:15,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:26:15,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:15,928 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:26:15,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:15,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:26:15,929 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:26:15,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:26:15,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:26:15,929 INFO L87 Difference]: Start difference. First operand 1498 states and 1992 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-23 04:26:16,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:16,252 INFO L93 Difference]: Finished difference Result 1497 states and 1812 transitions. [2018-11-23 04:26:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:26:16,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1497 states and 1812 transitions. [2018-11-23 04:26:16,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 04:26:16,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1497 states to 1497 states and 1812 transitions. [2018-11-23 04:26:16,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1497 [2018-11-23 04:26:16,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1497 [2018-11-23 04:26:16,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1497 states and 1812 transitions. [2018-11-23 04:26:16,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:26:16,263 INFO L705 BuchiCegarLoop]: Abstraction has 1497 states and 1812 transitions. [2018-11-23 04:26:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states and 1812 transitions. [2018-11-23 04:26:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2018-11-23 04:26:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-11-23 04:26:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1812 transitions. [2018-11-23 04:26:16,274 INFO L728 BuchiCegarLoop]: Abstraction has 1497 states and 1812 transitions. [2018-11-23 04:26:16,274 INFO L608 BuchiCegarLoop]: Abstraction has 1497 states and 1812 transitions. [2018-11-23 04:26:16,274 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 04:26:16,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1497 states and 1812 transitions. [2018-11-23 04:26:16,278 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 04:26:16,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:16,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:16,280 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:16,280 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:26:16,280 INFO L794 eck$LassoCheckResult]: Stem: 9392#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; 9269#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9270#L606-2 [2018-11-23 04:26:16,280 INFO L796 eck$LassoCheckResult]: Loop: 9270#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10081#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; 10080#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); 10079#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10077#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); 10075#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10073#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); 10056#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10057#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)); 10050#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); 10051#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); 10069#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); 10067#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10065#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); 10063#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10061#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10059#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9862#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); 9863#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); 10024#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10022#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); 10020#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10018#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10016#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); 10014#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10012#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); 10010#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); 10008#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9723#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; 9618#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9718#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9716#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; 9714#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); 9712#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9710#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); 9708#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9706#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); 9704#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9702#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)); 9700#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); 9698#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); 9696#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); 9694#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9692#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); 9690#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9688#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9686#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9684#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); 9682#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); 9680#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9678#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); 9676#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9674#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9672#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); 9670#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9668#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); 9665#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); 9663#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9661#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9659#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9657#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9655#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); 9653#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9651#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9649#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9647#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); 9645#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9643#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9641#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); 9639#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9637#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); 9635#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); 9633#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9631#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); 9629#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9627#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9625#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)); 9623#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); 9620#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; 9621#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9270#L606-2 [2018-11-23 04:26:16,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-23 04:26:16,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:16,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:16,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:16,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:16,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:16,284 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-23 04:26:16,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:16,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:26:16,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:16,350 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:26:16,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:16,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:26:16,350 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 04:26:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:26:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:26:16,351 INFO L87 Difference]: Start difference. First operand 1497 states and 1812 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-23 04:26:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:16,604 INFO L93 Difference]: Finished difference Result 1486 states and 1768 transitions. [2018-11-23 04:26:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:26:16,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1486 states and 1768 transitions. [2018-11-23 04:26:16,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 04:26:16,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1486 states to 1486 states and 1768 transitions. [2018-11-23 04:26:16,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1486 [2018-11-23 04:26:16,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1486 [2018-11-23 04:26:16,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1486 states and 1768 transitions. [2018-11-23 04:26:16,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:26:16,620 INFO L705 BuchiCegarLoop]: Abstraction has 1486 states and 1768 transitions. [2018-11-23 04:26:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states and 1768 transitions. [2018-11-23 04:26:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2018-11-23 04:26:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-11-23 04:26:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1768 transitions. [2018-11-23 04:26:16,637 INFO L728 BuchiCegarLoop]: Abstraction has 1486 states and 1768 transitions. [2018-11-23 04:26:16,637 INFO L608 BuchiCegarLoop]: Abstraction has 1486 states and 1768 transitions. [2018-11-23 04:26:16,637 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 04:26:16,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1486 states and 1768 transitions. [2018-11-23 04:26:16,642 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 04:26:16,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:16,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:16,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:26:16,643 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:26:16,643 INFO L794 eck$LassoCheckResult]: Stem: 12377#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; 12258#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12259#L606-2 [2018-11-23 04:26:16,644 INFO L796 eck$LassoCheckResult]: Loop: 12259#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13014#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; 13012#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); 13007#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13006#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); 13004#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13002#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); 13000#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 12998#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)); 12996#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); 12995#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); 12994#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); 12992#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12990#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); 12988#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12986#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12984#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12982#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); 12980#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); 12978#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12976#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); 12974#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12972#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12970#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); 12968#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12966#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); 12964#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); 12962#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12801#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12802#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12838#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12837#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); 12835#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12833#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12831#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12829#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); 12827#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12825#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12823#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); 12821#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12819#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); 12817#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); 12815#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 12813#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); 12811#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12808#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12809#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)); 12951#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); 12949#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); 12947#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 12945#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); 12869#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12870#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 12993#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); 12991#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); 12989#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 12987#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 12985#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); 12983#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 12981#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); 12979#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); 12977#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12975#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)); 12973#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 12971#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); 12969#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 12967#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)); 12965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 12963#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 12961#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12960#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)); 12958#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12956#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)); 12954#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12953#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12952#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12950#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); 12948#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12946#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12944#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12943#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12942#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12941#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12939#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12937#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12935#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12275#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12932#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12930#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12928#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12926#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12924#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12922#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12920#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12918#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12916#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12472#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12913#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12911#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12909#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12907#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12905#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12903#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12901#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12899#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12897#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12895#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12893#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12891#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12889#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12888#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12887#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12406#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13067#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13065#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13063#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13061#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13059#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13057#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13055#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13053#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13051#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13049#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13048#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13047#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13046#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13044#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13042#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13040#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13038#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13035#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13033#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13031#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13029#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13027#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13025#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13023#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13021#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13019#L594-1 calculate_output_#res := -2; 13017#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12259#L606-2 [2018-11-23 04:26:16,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:16,644 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-23 04:26:16,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:16,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:16,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:16,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:16,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-23 04:26:16,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:16,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:16,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:16,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:16,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:16,690 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-23 04:26:16,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:16,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:26:17,004 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:26:17,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:26:17,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 04:26:17,614 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-23 04:26:17,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:26:17,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:26:17,684 INFO L87 Difference]: Start difference. First operand 1486 states and 1768 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-23 04:26:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:26:18,505 INFO L93 Difference]: Finished difference Result 1676 states and 1955 transitions. [2018-11-23 04:26:18,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:26:18,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1676 states and 1955 transitions. [2018-11-23 04:26:18,511 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1621 [2018-11-23 04:26:18,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1676 states to 1676 states and 1955 transitions. [2018-11-23 04:26:18,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1676 [2018-11-23 04:26:18,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1676 [2018-11-23 04:26:18,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1676 states and 1955 transitions. [2018-11-23 04:26:18,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:26:18,521 INFO L705 BuchiCegarLoop]: Abstraction has 1676 states and 1955 transitions. [2018-11-23 04:26:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states and 1955 transitions. [2018-11-23 04:26:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1535. [2018-11-23 04:26:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-23 04:26:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1814 transitions. [2018-11-23 04:26:18,553 INFO L728 BuchiCegarLoop]: Abstraction has 1535 states and 1814 transitions. [2018-11-23 04:26:18,553 INFO L608 BuchiCegarLoop]: Abstraction has 1535 states and 1814 transitions. [2018-11-23 04:26:18,554 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 04:26:18,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1535 states and 1814 transitions. [2018-11-23 04:26:18,558 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1480 [2018-11-23 04:26:18,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:26:18,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:26:18,559 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:26:18,559 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:26:18,559 INFO L794 eck$LassoCheckResult]: Stem: 15560#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; 15445#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15446#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16722#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; 16720#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); 16718#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; 15702#L597 [2018-11-23 04:26:18,559 INFO L796 eck$LassoCheckResult]: Loop: 15702#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16956#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16954#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; 16952#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); 16950#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16948#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); 16946#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16945#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; 15702#L597 [2018-11-23 04:26:18,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-23 04:26:18,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:18,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:18,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:18,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:18,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:18,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-23 04:26:18,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:18,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:18,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:18,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:26:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-23 04:26:18,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:26:18,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:26:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:18,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:26:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:26:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:26:18,788 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:26:18,788 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:26:18,788 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:26:18,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:26:18,789 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:26:18,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:26:18,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:26:18,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:26:18,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-23 04:26:18,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:26:18,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:26:18,791 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:26:18,795 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:26:18,797 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:26:18,798 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:26:18,799 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:26:18,802 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:26:18,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:18,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:18,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:18,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:26:18,811 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:26:18,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:26:18,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:26:18,816 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:26:18,818 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:26:18,820 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:26:18,828 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:26:18,830 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:26:18,835 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:26:18,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:26:18,842 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:26:18,980 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:26:18,980 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:18,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:18,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:18,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:18,985 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,002 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,002 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,020 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,020 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,037 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,037 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,055 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,055 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,072 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,072 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,094 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,111 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,111 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,128 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,145 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,162 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,162 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,179 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,179 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,195 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,197 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,197 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,214 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,229 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,231 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,231 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,246 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:26:19,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,418 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,418 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,435 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,450 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:26:19,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,600 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,600 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,616 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,616 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,638 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,638 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_118ee576-4868-4e96-bd2c-00866912bde5/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:26:19,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:26:19,653 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:26:19,655 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 04:26:19,655 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:26:19,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:26:19 BoogieIcfgContainer [2018-11-23 04:26:19,695 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 04:26:19,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:26:19,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:26:19,696 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:26:19,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:26:10" (3/4) ... [2018-11-23 04:26:19,699 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:26:19,745 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_118ee576-4868-4e96-bd2c-00866912bde5/bin-2019/uautomizer/witness.graphml [2018-11-23 04:26:19,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:26:19,746 INFO L168 Benchmark]: Toolchain (without parser) took 10654.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 461.4 MB). Free memory was 948.9 MB in the beginning and 1.0 GB in the end (delta: -56.0 MB). Peak memory consumption was 405.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:26:19,747 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:26:19,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.53 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 919.3 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:26:19,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 919.3 MB in the beginning and 1.1 GB in the end (delta: -209.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-23 04:26:19,748 INFO L168 Benchmark]: Boogie Preprocessor took 39.68 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: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:26:19,748 INFO L168 Benchmark]: RCFGBuilder took 896.89 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: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:26:19,748 INFO L168 Benchmark]: BuchiAutomizer took 9168.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.3 MB). Peak memory consumption was 333.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:26:19,748 INFO L168 Benchmark]: Witness Printer took 50.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:26:19,754 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.53 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 919.3 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 919.3 MB in the beginning and 1.1 GB in the end (delta: -209.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.68 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: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 896.89 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: 108.3 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9168.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 321.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.3 MB). Peak memory consumption was 333.2 MB. Max. memory is 11.5 GB. * Witness Printer took 50.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 9.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.0s. Construction of modules took 2.7s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 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, 2473 SDslu, 548 SDs, 0 SdLazy, 3949 SolverSat, 844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s 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: 58ms 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@43d30b2e=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f0b3668=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@43d30b2e=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f0b3668=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@43d30b2e=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@7f0b3668=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...