./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-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_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 eb2ed652d9060283eed99b129e3cfec21e515617 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 06:40:31,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:40:31,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:40:31,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:40:31,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:40:31,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:40:31,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:40:31,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:40:31,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:40:31,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:40:31,106 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:40:31,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:40:31,107 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:40:31,107 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:40:31,108 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:40:31,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:40:31,109 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:40:31,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:40:31,112 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:40:31,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:40:31,113 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:40:31,114 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:40:31,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:40:31,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:40:31,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:40:31,116 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:40:31,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:40:31,118 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:40:31,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:40:31,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:40:31,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:40:31,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:40:31,119 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:40:31,120 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:40:31,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:40:31,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:40:31,121 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:40:31,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:40:31,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:40:31,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:40:31,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:40:31,132 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:40:31,132 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:40:31,132 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:40:31,132 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:40:31,132 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:40:31,133 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:40:31,133 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:40:31,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:40:31,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:40:31,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:40:31,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:40:31,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:40:31,134 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:40:31,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:40:31,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:40:31,135 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:40:31,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:40:31,135 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:40:31,135 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:40:31,136 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:40:31,136 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 -> eb2ed652d9060283eed99b129e3cfec21e515617 [2018-11-23 06:40:31,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:40:31,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:40:31,170 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:40:31,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:40:31,171 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:40:31,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-11-23 06:40:31,207 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/data/2d9a5e0b5/e2c27165ca3b4aa1959728c84a51948c/FLAG8b4dc19db [2018-11-23 06:40:31,563 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:40:31,564 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/sv-benchmarks/c/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c [2018-11-23 06:40:31,572 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/data/2d9a5e0b5/e2c27165ca3b4aa1959728c84a51948c/FLAG8b4dc19db [2018-11-23 06:40:31,584 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/data/2d9a5e0b5/e2c27165ca3b4aa1959728c84a51948c [2018-11-23 06:40:31,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:40:31,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:40:31,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:40:31,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:40:31,590 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:40:31,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:31,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31, skipping insertion in model container [2018-11-23 06:40:31,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:31,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:40:31,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:40:31,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:40:31,871 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:40:31,935 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:40:31,946 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:40:31,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31 WrapperNode [2018-11-23 06:40:31,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:40:31,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:40:31,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:40:31,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:40:32,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:40:32,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:40:32,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:40:32,060 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:40:32,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... [2018-11-23 06:40:32,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:40:32,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:40:32,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:40:32,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:40:32,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 06:40:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:40:32,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:40:32,901 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:40:32,901 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 06:40:32,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:40:32 BoogieIcfgContainer [2018-11-23 06:40:32,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:40:32,902 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:40:32,902 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:40:32,904 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:40:32,905 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:40:32,905 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:40:31" (1/3) ... [2018-11-23 06:40:32,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a9c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:40:32, skipping insertion in model container [2018-11-23 06:40:32,907 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:40:32,907 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:31" (2/3) ... [2018-11-23 06:40:32,907 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a9c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:40:32, skipping insertion in model container [2018-11-23 06:40:32,908 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:40:32,908 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:40:32" (3/3) ... [2018-11-23 06:40:32,909 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label44_false-unreach-call_false-termination.c [2018-11-23 06:40:32,953 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:40:32,954 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:40:32,954 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:40:32,954 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:40:32,954 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:40:32,954 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:40:32,954 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:40:32,954 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:40:32,955 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:40:32,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 06:40:33,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 06:40:33,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:33,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:33,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:33,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:40:33,012 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:40:33,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 06:40:33,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 06:40:33,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:33,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:33,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:33,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:40:33,024 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 06:40:33,025 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 06:40:33,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 06:40:33,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:33,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:33,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:33,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-23 06:40:33,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:33,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:33,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:33,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:33,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:33,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-23 06:40:33,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:33,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:33,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:33,187 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 06:40:33,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:33,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:40:33,293 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:40:33,294 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:40:33,294 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:40:33,294 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:40:33,294 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:40:33,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:40:33,295 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:40:33,295 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:40:33,295 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 06:40:33,295 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:40:33,295 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:40:33,311 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 06:40:33,316 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 06:40:33,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,347 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 06:40:33,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,527 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:40:33,527 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:33,540 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,562 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,574 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:33,574 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,598 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,601 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:33,601 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,619 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:33,625 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,651 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:33,651 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,667 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,677 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:33,677 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,701 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:33,702 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,723 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:33,724 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:33,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:40:33,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:33,782 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:40:33,783 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:40:33,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:40:33,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:40:33,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:40:33,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:40:33,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:40:33,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:40:33,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:40:33,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 06:40:33,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:40:33,785 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:40:33,788 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 06:40:33,823 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 06:40:33,826 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 06:40:33,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:33,868 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 06:40:34,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:40:34,011 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:40:34,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:34,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:34,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,031 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:34,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:34,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:34,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:34,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,067 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:34,068 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,076 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 06:40:34,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 06:40:34,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,079 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,080 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,090 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,091 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,095 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,095 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,097 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 06:40:34,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,114 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,115 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,126 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,126 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,134 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,134 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,140 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,140 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,146 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 06:40:34,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 06:40:34,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,147 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,148 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,158 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,164 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,164 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,166 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:40:34,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,184 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,189 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,189 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,192 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,194 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,194 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,195 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:34,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,199 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 06:40:34,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,201 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,201 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,209 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,209 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,213 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,213 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,215 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 06:40:34,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,230 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,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 06:40:34,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,235 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,235 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,238 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,238 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,244 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,245 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:34,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,246 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,247 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,247 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:34,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,252 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 06:40:34,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,253 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,253 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,257 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,268 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,268 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,269 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,273 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,273 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,273 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,275 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 06:40:34,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,325 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,326 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,326 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,331 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,331 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,332 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,335 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,335 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,335 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,338 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,338 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,339 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,339 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:34,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,341 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:34,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,348 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 06:40:34,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,349 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,351 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,364 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,364 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,365 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,369 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,369 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,369 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,372 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:40:34,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,402 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,402 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,403 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,408 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,409 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,409 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,413 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,414 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,414 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,418 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,418 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,419 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,419 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,421 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:34,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,421 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,422 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:34,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,430 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 06:40:34,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,431 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,431 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,433 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,445 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,445 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,446 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,451 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,451 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,451 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,456 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 06:40:34,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,492 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,492 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,493 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,494 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,501 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,501 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,501 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,502 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,507 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,507 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,508 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,513 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,513 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,514 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:34,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,516 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,516 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,516 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:34,518 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:34,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,528 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 06:40:34,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,529 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,530 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,541 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,541 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,544 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,545 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,545 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,547 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:40:34,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,564 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,570 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,570 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,570 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,573 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,573 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,573 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,576 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,576 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,576 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:34,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:34,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,579 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,579 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:34,579 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:34,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,585 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 06:40:34,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,586 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,586 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,617 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,617 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,621 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,621 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,621 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 06:40:34,621 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,624 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 06:40:34,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,706 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,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 06:40:34,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,715 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,716 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,719 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,720 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,723 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:34,723 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:34,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:34,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:34,727 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:34,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:34,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:34,727 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:34,727 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:34,728 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:40:34,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:34,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:40:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:40:34,751 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-23 06:40:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:35,361 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2018-11-23 06:40:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:40:35,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 546 transitions. [2018-11-23 06:40:35,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 370 [2018-11-23 06:40:35,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 372 states and 539 transitions. [2018-11-23 06:40:35,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-23 06:40:35,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-23 06:40:35,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 539 transitions. [2018-11-23 06:40:35,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:40:35,378 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 539 transitions. [2018-11-23 06:40:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 539 transitions. [2018-11-23 06:40:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-23 06:40:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-23 06:40:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 537 transitions. [2018-11-23 06:40:35,410 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 06:40:35,410 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 06:40:35,410 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:40:35,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 537 transitions. [2018-11-23 06:40:35,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 369 [2018-11-23 06:40:35,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:35,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:35,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:35,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:40:35,413 INFO L794 eck$LassoCheckResult]: Stem: 749#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 06:40:35,413 INFO L796 eck$LassoCheckResult]: Loop: 629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 731#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; 732#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); 867#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 758#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); 693#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 694#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); 841#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 06:40:35,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:35,413 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 06:40:35,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:35,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:35,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:35,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:35,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:35,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-23 06:40:35,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:35,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:35,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:40:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:35,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-23 06:40:35,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:35,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:35,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:35,446 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 06:40:35,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:35,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:40:35,540 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:40:35,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:40:35,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:40:35,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:40:35,540 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:40:35,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:40:35,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:40:35,541 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:40:35,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 06:40:35,541 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:40:35,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:40:35,542 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 06:40:35,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 06:40:35,555 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 06:40:35,558 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 06:40:35,560 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 06:40:35,562 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 06:40:35,566 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 06:40:35,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:35,687 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:40:35,687 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:35,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:35,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:35,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:35,694 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:35,710 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:35,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:35,714 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:35,714 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:35,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:35,734 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:35,736 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:35,736 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:35,766 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:35,766 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:35,768 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:35,768 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:35,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:35,793 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:35,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:35,797 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:35,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:35,814 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:35,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:40:35,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:35,866 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:40:35,868 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:40:35,868 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:40:35,868 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:40:35,868 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:40:35,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:40:35,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:40:35,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:40:35,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:40:35,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 06:40:35,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:40:35,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:40:35,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:35,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:35,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:35,881 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 06:40:35,882 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 06:40:35,884 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 06:40:35,888 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 06:40:35,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:35,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:40:35,998 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:40:35,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:35,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:35,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:35,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:36,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:36,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,009 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:36,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:36,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,016 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,016 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,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 06:40:36,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,019 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,019 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:40:36,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:40:36,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,025 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 06:40:36,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 06:40:36,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,026 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,026 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,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 06:40:36,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,028 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,029 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,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 06:40:36,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,031 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,031 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,033 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,034 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,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 06:40:36,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,035 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,035 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,037 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,037 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,041 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,046 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,046 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,049 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 06:40:36,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,050 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,050 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,053 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,053 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,056 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,056 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,058 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,058 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,060 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,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 06:40:36,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,062 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,063 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,063 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,067 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,067 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,067 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,073 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,074 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,077 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 06:40:36,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,078 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,081 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,081 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,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 06:40:36,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,084 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,085 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,085 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:36,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,087 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,087 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,089 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,089 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,091 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,091 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,092 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:36,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,096 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,096 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,097 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:36,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:40:36,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,103 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,104 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,108 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 06:40:36,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,108 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,108 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,109 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,112 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,113 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,113 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,117 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,118 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,118 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,120 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,121 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,121 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,122 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,126 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,126 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,126 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,126 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,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 06:40:36,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,132 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,132 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,133 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,142 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,142 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,143 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:40:36,143 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:40:36,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,148 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 06:40:36,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,148 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,149 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,153 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,153 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,154 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,159 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,159 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,160 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,162 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,163 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,163 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,165 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,166 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,170 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,170 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,170 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,171 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,234 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,234 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,234 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,236 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,247 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:40:36,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,247 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,249 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,254 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 06:40:36,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,255 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,255 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,256 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,261 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,261 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,262 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,268 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,268 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,269 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,269 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,270 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:36,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,272 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,272 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,273 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,275 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,275 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,276 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,280 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,281 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,282 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:36,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,292 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,292 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,292 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,292 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,295 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:40:36,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,312 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,313 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:40:36,315 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:40:36,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,323 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 06:40:36,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,323 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,324 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,324 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,326 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,326 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,327 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,327 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,331 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,331 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,331 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,332 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,334 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,334 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,334 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,336 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,337 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,337 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,339 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,339 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,339 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,340 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,345 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,345 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,345 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,346 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:40:36,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,353 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:40:36,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,353 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:40:36,354 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:40:36,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,359 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 06:40:36,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,360 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,360 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,364 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,372 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,372 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,372 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,373 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:40:36,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,375 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,376 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,379 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,379 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,382 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,383 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,383 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,383 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:40:36,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,391 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,391 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:40:36,392 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,393 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:40:36,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:40:36,412 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:40:36,412 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:40:36,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:40:36,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:40:36,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:40:36,413 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:40:36,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:40:36,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:40:36,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:40:36,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:40:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:40:36,434 INFO L87 Difference]: Start difference. First operand 371 states and 537 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-23 06:40:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:36,788 INFO L93 Difference]: Finished difference Result 656 states and 914 transitions. [2018-11-23 06:40:36,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:40:36,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 914 transitions. [2018-11-23 06:40:36,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 06:40:36,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 914 transitions. [2018-11-23 06:40:36,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 656 [2018-11-23 06:40:36,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 656 [2018-11-23 06:40:36,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 914 transitions. [2018-11-23 06:40:36,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:40:36,803 INFO L705 BuchiCegarLoop]: Abstraction has 656 states and 914 transitions. [2018-11-23 06:40:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 914 transitions. [2018-11-23 06:40:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2018-11-23 06:40:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-23 06:40:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 914 transitions. [2018-11-23 06:40:36,819 INFO L728 BuchiCegarLoop]: Abstraction has 656 states and 914 transitions. [2018-11-23 06:40:36,819 INFO L608 BuchiCegarLoop]: Abstraction has 656 states and 914 transitions. [2018-11-23 06:40:36,819 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:40:36,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 656 states and 914 transitions. [2018-11-23 06:40:36,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 06:40:36,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:36,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:36,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:36,824 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 06:40:36,824 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 06:40:36,828 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); 1922#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; 2198#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2196#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; 2194#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); 2192#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2190#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); 2188#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2186#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); 2184#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2182#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)); 2180#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); 2178#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); 2176#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); 2173#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2171#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); 2169#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2167#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2165#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2163#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); 2161#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); 2159#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2157#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); 2155#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2153#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2151#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); 2149#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2147#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); 2145#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); 2143#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2141#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2139#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2137#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2135#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); 2133#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2131#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2129#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2127#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); 2125#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2123#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2121#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); 2119#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2117#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); 2115#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); 2113#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2111#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); 2109#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2107#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2105#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)); 2103#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); 2101#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; 1812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1665#L606-2 [2018-11-23 06:40:36,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 06:40:36,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:36,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:36,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:36,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:36,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:36,842 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-23 06:40:36,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:36,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:36,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:36,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:40:36,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:36,903 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 06:40:36,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:36,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 06:40:36,904 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:40:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 06:40:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 06:40:36,904 INFO L87 Difference]: Start difference. First operand 656 states and 914 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-23 06:40:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:37,582 INFO L93 Difference]: Finished difference Result 1220 states and 1693 transitions. [2018-11-23 06:40:37,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 06:40:37,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 1693 transitions. [2018-11-23 06:40:37,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1216 [2018-11-23 06:40:37,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1220 states and 1693 transitions. [2018-11-23 06:40:37,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1220 [2018-11-23 06:40:37,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1220 [2018-11-23 06:40:37,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1220 states and 1693 transitions. [2018-11-23 06:40:37,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:40:37,598 INFO L705 BuchiCegarLoop]: Abstraction has 1220 states and 1693 transitions. [2018-11-23 06:40:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states and 1693 transitions. [2018-11-23 06:40:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2018-11-23 06:40:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-11-23 06:40:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2018-11-23 06:40:37,615 INFO L728 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-23 06:40:37,616 INFO L608 BuchiCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2018-11-23 06:40:37,616 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:40:37,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1217 states and 1687 transitions. [2018-11-23 06:40:37,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1213 [2018-11-23 06:40:37,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:37,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:37,622 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:37,622 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 06:40:37,622 INFO L794 eck$LassoCheckResult]: Stem: 3672#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 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 06:40:37,622 INFO L796 eck$LassoCheckResult]: Loop: 3547#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4632#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; 4631#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); 4630#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4628#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); 4626#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4624#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); 4284#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; 3730#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4264#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4261#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; 4260#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; 3651#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4613#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4611#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; 4167#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); 4158#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4157#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); 4155#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4153#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); 4151#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4149#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)); 4147#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); 4145#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); 4143#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); 4141#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4139#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); 4137#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4135#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4131#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); 4129#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); 4127#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4125#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); 4123#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4121#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4119#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); 4117#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4115#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); 4113#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); 4111#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4109#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4107#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4105#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4103#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); 4101#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4099#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4097#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4095#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); 4093#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4091#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4089#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); 4087#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4085#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); 4083#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); 4081#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4079#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); 4077#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4075#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4073#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)); 4071#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); 4069#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; 3694#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3547#L606-2 [2018-11-23 06:40:37,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 06:40:37,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:37,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:37,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:37,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:37,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:37,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:37,627 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-23 06:40:37,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:37,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:37,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:37,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:40:37,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:37,650 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 06:40:37,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:37,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:40:37,651 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:40:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:40:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:40:37,651 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-11-23 06:40:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:38,092 INFO L93 Difference]: Finished difference Result 1499 states and 1994 transitions. [2018-11-23 06:40:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:40:38,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1499 states and 1994 transitions. [2018-11-23 06:40:38,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1495 [2018-11-23 06:40:38,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1499 states to 1499 states and 1994 transitions. [2018-11-23 06:40:38,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1499 [2018-11-23 06:40:38,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1499 [2018-11-23 06:40:38,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1499 states and 1994 transitions. [2018-11-23 06:40:38,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:40:38,108 INFO L705 BuchiCegarLoop]: Abstraction has 1499 states and 1994 transitions. [2018-11-23 06:40:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states and 1994 transitions. [2018-11-23 06:40:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1498. [2018-11-23 06:40:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2018-11-23 06:40:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1992 transitions. [2018-11-23 06:40:38,127 INFO L728 BuchiCegarLoop]: Abstraction has 1498 states and 1992 transitions. [2018-11-23 06:40:38,127 INFO L608 BuchiCegarLoop]: Abstraction has 1498 states and 1992 transitions. [2018-11-23 06:40:38,127 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:40:38,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1498 states and 1992 transitions. [2018-11-23 06:40:38,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 06:40:38,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:38,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:38,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:38,134 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 06:40:38,134 INFO L794 eck$LassoCheckResult]: Stem: 6396#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 06:40:38,135 INFO L796 eck$LassoCheckResult]: Loop: 6269#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7593#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; 7589#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); 7585#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7581#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); 7577#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7575#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); 7528#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6270#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)); 6271#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); 6272#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); 6273#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); 6527#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6414#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); 6415#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6469#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6397#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6398#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; 6503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6890#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6888#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; 6886#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; 6374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6902#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6892#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; 6891#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); 6889#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6887#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); 6885#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6883#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); 6881#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6879#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)); 6877#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); 6875#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); 6873#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); 6871#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6869#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); 6867#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6865#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6863#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6861#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); 6859#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); 6857#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6855#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); 6853#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6851#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6849#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); 6847#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6845#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); 6843#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); 6841#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6839#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6837#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6835#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6833#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); 6831#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6829#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6827#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6825#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); 6823#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6821#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6819#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); 6817#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6815#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); 6813#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); 6811#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6809#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); 6807#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6805#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6803#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)); 6801#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); 6798#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; 6799#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6269#L606-2 [2018-11-23 06:40:38,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-23 06:40:38,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:38,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:38,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:38,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:38,139 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-23 06:40:38,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:38,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:40:38,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:38,165 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 06:40:38,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:38,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:40:38,165 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:40:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:40:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:40:38,166 INFO L87 Difference]: Start difference. First operand 1498 states and 1992 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-11-23 06:40:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:38,555 INFO L93 Difference]: Finished difference Result 1497 states and 1813 transitions. [2018-11-23 06:40:38,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:40:38,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1497 states and 1813 transitions. [2018-11-23 06:40:38,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 06:40:38,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1497 states to 1497 states and 1813 transitions. [2018-11-23 06:40:38,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1497 [2018-11-23 06:40:38,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1497 [2018-11-23 06:40:38,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1497 states and 1813 transitions. [2018-11-23 06:40:38,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:40:38,572 INFO L705 BuchiCegarLoop]: Abstraction has 1497 states and 1813 transitions. [2018-11-23 06:40:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states and 1813 transitions. [2018-11-23 06:40:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2018-11-23 06:40:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-11-23 06:40:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1813 transitions. [2018-11-23 06:40:38,590 INFO L728 BuchiCegarLoop]: Abstraction has 1497 states and 1813 transitions. [2018-11-23 06:40:38,590 INFO L608 BuchiCegarLoop]: Abstraction has 1497 states and 1813 transitions. [2018-11-23 06:40:38,590 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:40:38,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1497 states and 1813 transitions. [2018-11-23 06:40:38,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 06:40:38,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:38,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:38,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:38,596 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 06:40:38,596 INFO L794 eck$LassoCheckResult]: Stem: 9393#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 06:40:38,596 INFO L796 eck$LassoCheckResult]: Loop: 9270#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9374#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; 9375#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); 9547#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10519#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); 9334#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9335#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); 10488#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10510#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)); 10505#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); 10506#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); 10747#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); 10746#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10745#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); 10744#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10609#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9394#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9395#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); 9843#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); 10014#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10012#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); 10009#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10007#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10005#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); 10003#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10000#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); 9995#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); 9990#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9733#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; 9629#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9728#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9726#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; 9724#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); 9722#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9720#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); 9718#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9716#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); 9714#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9712#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)); 9710#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); 9708#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); 9706#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); 9704#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9702#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); 9700#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9698#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9696#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9694#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); 9692#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); 9690#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9688#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); 9686#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9684#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9682#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); 9680#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9678#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); 9676#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); 9673#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9671#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9669#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9667#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9665#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); 9663#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9661#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9659#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9657#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); 9655#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9653#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9651#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); 9649#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9647#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); 9645#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); 9643#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9641#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); 9639#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9637#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9635#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)); 9633#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); 9631#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; 9417#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9270#L606-2 [2018-11-23 06:40:38,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-23 06:40:38,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:38,601 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-23 06:40:38,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:38,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:38,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:40:38,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:38,651 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 06:40:38,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:38,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:40:38,651 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:40:38,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:40:38,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:40:38,652 INFO L87 Difference]: Start difference. First operand 1497 states and 1813 transitions. cyclomatic complexity: 318 Second operand 3 states. [2018-11-23 06:40:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:38,874 INFO L93 Difference]: Finished difference Result 1486 states and 1769 transitions. [2018-11-23 06:40:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:40:38,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1486 states and 1769 transitions. [2018-11-23 06:40:38,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 06:40:38,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1486 states to 1486 states and 1769 transitions. [2018-11-23 06:40:38,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1486 [2018-11-23 06:40:38,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1486 [2018-11-23 06:40:38,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1486 states and 1769 transitions. [2018-11-23 06:40:38,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:40:38,890 INFO L705 BuchiCegarLoop]: Abstraction has 1486 states and 1769 transitions. [2018-11-23 06:40:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states and 1769 transitions. [2018-11-23 06:40:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2018-11-23 06:40:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-11-23 06:40:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1769 transitions. [2018-11-23 06:40:38,907 INFO L728 BuchiCegarLoop]: Abstraction has 1486 states and 1769 transitions. [2018-11-23 06:40:38,907 INFO L608 BuchiCegarLoop]: Abstraction has 1486 states and 1769 transitions. [2018-11-23 06:40:38,907 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 06:40:38,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1486 states and 1769 transitions. [2018-11-23 06:40:38,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 06:40:38,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:38,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:38,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 06:40:38,913 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 06:40:38,913 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 06:40:38,914 INFO L796 eck$LassoCheckResult]: Loop: 12259#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13012#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; 13010#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); 13008#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)); 12993#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); 12992#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); 12990#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); 12988#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12986#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); 12984#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12982#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12981#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12980#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); 12978#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); 12976#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12974#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); 12972#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12970#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12968#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); 12966#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12964#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); 12962#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); 12960#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12791#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12281#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12246#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12247#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); 12330#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12331#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12360#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12290#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); 12291#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13720#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13718#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); 13716#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13714#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); 13712#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); 13702#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13640#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); 13639#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12799#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12800#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)); 13642#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); 12872#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); 12862#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 12861#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); 12859#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12857#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 12856#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); 12855#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); 12853#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 12851#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 12849#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); 12848#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 12846#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); 12845#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); 12844#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12842#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)); 12841#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 12839#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); 12838#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 12837#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)); 12836#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 12834#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 12833#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12831#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)); 12829#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12827#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)); 12825#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12823#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12821#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12819#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); 12817#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12816#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12815#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12813#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12811#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12809#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12807#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12805#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12803#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12276#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12920#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12918#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12916#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12914#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12912#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12910#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12908#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12906#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12904#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12467#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12902#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12900#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12899#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12897#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12895#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12893#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12891#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12889#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12887#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12885#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12883#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12881#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12879#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12877#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12875#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12407#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13064#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13062#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13060#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13058#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13056#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13054#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13052#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13050#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13048#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13046#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13044#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13042#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13040#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13038#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13036#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13034#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13033#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13032#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13031#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13029#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13027#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13025#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13023#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13021#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13019#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13017#L594-1 calculate_output_#res := -2; 13015#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12259#L606-2 [2018-11-23 06:40:38,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-23 06:40:38,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-23 06:40:38,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:38,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:38,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:38,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-23 06:40:38,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:38,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:39,357 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 06:40:39,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:39,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 06:40:40,090 WARN L180 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-23 06:40:40,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 06:40:40,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 06:40:40,166 INFO L87 Difference]: Start difference. First operand 1486 states and 1769 transitions. cyclomatic complexity: 286 Second operand 10 states. [2018-11-23 06:40:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:40,985 INFO L93 Difference]: Finished difference Result 1676 states and 1956 transitions. [2018-11-23 06:40:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 06:40:40,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1676 states and 1956 transitions. [2018-11-23 06:40:40,991 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1621 [2018-11-23 06:40:40,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1676 states to 1676 states and 1956 transitions. [2018-11-23 06:40:40,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1676 [2018-11-23 06:40:40,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1676 [2018-11-23 06:40:40,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1676 states and 1956 transitions. [2018-11-23 06:40:40,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:40:40,997 INFO L705 BuchiCegarLoop]: Abstraction has 1676 states and 1956 transitions. [2018-11-23 06:40:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states and 1956 transitions. [2018-11-23 06:40:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1535. [2018-11-23 06:40:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-23 06:40:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1815 transitions. [2018-11-23 06:40:41,012 INFO L728 BuchiCegarLoop]: Abstraction has 1535 states and 1815 transitions. [2018-11-23 06:40:41,012 INFO L608 BuchiCegarLoop]: Abstraction has 1535 states and 1815 transitions. [2018-11-23 06:40:41,012 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 06:40:41,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1535 states and 1815 transitions. [2018-11-23 06:40:41,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1480 [2018-11-23 06:40:41,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:40:41,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:40:41,017 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:40:41,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:40:41,018 INFO L794 eck$LassoCheckResult]: Stem: 15564#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; 16331#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; 16329#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); 16220#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; 15824#L597 [2018-11-23 06:40:41,018 INFO L796 eck$LassoCheckResult]: Loop: 15824#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16207#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16205#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; 16203#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); 16201#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16199#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); 16198#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16197#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; 15824#L597 [2018-11-23 06:40:41,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:41,018 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-23 06:40:41,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:41,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:41,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:41,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:41,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:41,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-23 06:40:41,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:41,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:41,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-23 06:40:41,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:40:41,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:40:41,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:41,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:41,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:41,219 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:40:41,219 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:40:41,219 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:40:41,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:40:41,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:40:41,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:40:41,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:40:41,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:40:41,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label44_false-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-23 06:40:41,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:40:41,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:40:41,221 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 06:40:41,224 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 06:40:41,226 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 06:40:41,228 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 06:40:41,230 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 06:40:41,231 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 06:40:41,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 06:40:41,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:40:41,237 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 06:40:41,239 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 06:40:41,240 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 06:40:41,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 06:40:41,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 06:40:41,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 06:40:41,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 06:40:41,247 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 06:40:41,254 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 06:40:41,256 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 06:40:41,271 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 06:40:41,273 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 06:40:41,275 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 06:40:41,389 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:40:41,389 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,395 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,412 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,429 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,445 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,447 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,447 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,465 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,465 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,483 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,500 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,500 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,517 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,517 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,533 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,535 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,535 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,550 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,552 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,571 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,571 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,589 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,589 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,607 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,607 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,623 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,625 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,639 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,640 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,641 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,641 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,656 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:40:41,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,829 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,829 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:41,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:41,847 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:41,862 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:41,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:40:41,880 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:42,015 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:42,015 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:42,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:42,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:42,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:42,033 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:42,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:42,049 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:42,052 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:42,052 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_122f8601-cb6b-45fb-92d9-4311b399dbb2/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 06:40:42,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:40:42,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:40:42,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:40:42,069 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 06:40:42,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:40:42 BoogieIcfgContainer [2018-11-23 06:40:42,109 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:40:42,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:40:42,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:40:42,110 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:40:42,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:40:32" (3/4) ... [2018-11-23 06:40:42,113 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 06:40:42,161 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_122f8601-cb6b-45fb-92d9-4311b399dbb2/bin-2019/uautomizer/witness.graphml [2018-11-23 06:40:42,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:40:42,162 INFO L168 Benchmark]: Toolchain (without parser) took 10575.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 453.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 319.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:42,162 INFO L168 Benchmark]: CDTParser took 0.10 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 06:40:42,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 916.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:42,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 916.2 MB in the beginning and 1.1 GB in the end (delta: -227.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:42,163 INFO L168 Benchmark]: Boogie Preprocessor took 42.66 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: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:42,163 INFO L168 Benchmark]: RCFGBuilder took 798.97 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: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:42,164 INFO L168 Benchmark]: BuchiAutomizer took 9207.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -44.6 MB). Peak memory consumption was 529.6 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:42,164 INFO L168 Benchmark]: Witness Printer took 51.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:40:42,166 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 916.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 916.2 MB in the beginning and 1.1 GB in the end (delta: -227.2 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.66 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: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 798.97 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: 104.0 MB). Peak memory consumption was 104.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9207.73 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 298.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -44.6 MB). Peak memory consumption was 529.6 MB. Max. memory is 11.5 GB. * Witness Printer took 51.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1535 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 2.6s. 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: 1457 SDtfs, 2475 SDslu, 547 SDs, 0 SdLazy, 3949 SolverSat, 844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s 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: 83ms 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@59c6c71=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27091914=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@59c6c71=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27091914=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@59c6c71=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@27091914=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...