./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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 d21c5ccf8cec8e25a14d9a868b5f3d1150798ab4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 10:50:37,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:50:37,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:50:37,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:50:37,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:50:37,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:50:37,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:50:37,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:50:37,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:50:37,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:50:37,157 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:50:37,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:50:37,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:50:37,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:50:37,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:50:37,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:50:37,160 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:50:37,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:50:37,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:50:37,165 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:50:37,166 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:50:37,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:50:37,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:50:37,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:50:37,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:50:37,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:50:37,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:50:37,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:50:37,171 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:50:37,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:50:37,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:50:37,173 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:50:37,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:50:37,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:50:37,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:50:37,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:50:37,175 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:50:37,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:50:37,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:50:37,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:50:37,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:50:37,188 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:50:37,188 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:50:37,188 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:50:37,188 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:50:37,189 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:50:37,189 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:50:37,189 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:50:37,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:50:37,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:50:37,189 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:50:37,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:50:37,190 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:50:37,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:50:37,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:50:37,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:50:37,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:50:37,191 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:50:37,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:50:37,191 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:50:37,191 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:50:37,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:50:37,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:50:37,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:50:37,191 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:50:37,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:50:37,192 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:50:37,192 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:50:37,192 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:50:37,192 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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 -> d21c5ccf8cec8e25a14d9a868b5f3d1150798ab4 [2018-11-18 10:50:37,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:50:37,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:50:37,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:50:37,234 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:50:37,234 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:50:37,235 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-11-18 10:50:37,293 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/data/0d36806a4/6bef57c573bf453f86dbc23ba0f4026b/FLAGeeb1a77a9 [2018-11-18 10:50:37,709 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:50:37,709 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/sv-benchmarks/c/eca-rers2012/Problem02_label48_true-unreach-call_false-termination.c [2018-11-18 10:50:37,717 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/data/0d36806a4/6bef57c573bf453f86dbc23ba0f4026b/FLAGeeb1a77a9 [2018-11-18 10:50:37,729 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/data/0d36806a4/6bef57c573bf453f86dbc23ba0f4026b [2018-11-18 10:50:37,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:50:37,734 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:50:37,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:50:37,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:50:37,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:50:37,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:37" (1/1) ... [2018-11-18 10:50:37,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6654e84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:37, skipping insertion in model container [2018-11-18 10:50:37,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:37" (1/1) ... [2018-11-18 10:50:37,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:50:37,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:50:38,087 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:50:38,092 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:50:38,170 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:50:38,183 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:50:38,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38 WrapperNode [2018-11-18 10:50:38,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:50:38,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:50:38,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:50:38,184 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:50:38,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:50:38,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:50:38,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:50:38,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:50:38,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... [2018-11-18 10:50:38,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:50:38,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:50:38,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:50:38,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:50:38,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:38,514 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 10:50:38,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:50:38,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:50:42,482 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:50:42,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:42 BoogieIcfgContainer [2018-11-18 10:50:42,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:50:42,483 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:50:42,483 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:50:42,486 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:50:42,487 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:50:42,487 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:50:37" (1/3) ... [2018-11-18 10:50:42,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d5f9ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:50:42, skipping insertion in model container [2018-11-18 10:50:42,488 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:50:42,488 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:38" (2/3) ... [2018-11-18 10:50:42,488 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d5f9ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:50:42, skipping insertion in model container [2018-11-18 10:50:42,490 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:50:42,490 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:42" (3/3) ... [2018-11-18 10:50:42,492 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label48_true-unreach-call_false-termination.c [2018-11-18 10:50:42,537 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:50:42,538 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:50:42,538 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:50:42,538 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:50:42,538 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:50:42,539 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:50:42,539 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:50:42,539 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:50:42,539 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:50:42,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 10:50:42,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 10:50:42,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:42,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:42,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:42,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:50:42,601 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:50:42,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-18 10:50:42,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-18 10:50:42,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:42,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:42,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:42,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 10:50:42,620 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~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 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-18 10:50:42,620 INFO L796 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true 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);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#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; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-18 10:50:42,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:50:42,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:42,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:42,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:42,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:42,721 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-18 10:50:42,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:42,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:42,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:42,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:42,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-18 10:50:42,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:42,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:42,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:42,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:42,935 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-18 10:50:42,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:50:42,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:50:43,151 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-18 10:50:43,219 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:50:43,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:50:43,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:50:43,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:50:43,221 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:50:43,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:50:43,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:50:43,221 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:50:43,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label48_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 10:50:43,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:50:43,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:50:43,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-18 10:50:43,250 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-18 10:50:43,322 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-18 10:50:43,324 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-18 10:50:43,328 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-18 10:50:43,330 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-18 10:50:43,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:43,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:43,621 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:50:43,621 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:43,630 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:43,631 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:43,653 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:43,653 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,671 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,671 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:43,673 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:43,673 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:43,697 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:43,697 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,724 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:43,729 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:43,729 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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) [2018-11-18 10:50:43,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,754 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:50:43,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:43,760 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,779 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:43,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:43,794 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:43,833 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:43,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:50:43,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:43,886 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:50:43,888 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:50:43,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:50:43,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:50:43,888 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:50:43,889 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:50:43,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:50:43,889 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:50:43,889 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:50:43,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label48_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-18 10:50:43,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:50:43,889 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:50:43,891 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-18 10:50:43,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:43,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:43,930 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-18 10:50:43,935 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-18 10:50:43,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:43,941 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-18 10:50:43,946 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-18 10:50:44,125 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 10:50:44,510 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-18 10:50:44,786 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-18 10:50:44,787 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:50:44,791 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:50:44,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:44,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:44,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,811 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:44,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:44,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:44,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:44,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:44,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:44,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,861 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:44,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:44,862 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:44,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,866 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 10:50:44,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,868 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,873 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:44,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,886 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,886 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:44,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,891 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:44,892 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,893 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 10:50:44,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,915 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,916 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:44,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,922 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,922 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:44,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,926 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,926 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:44,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,932 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,933 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:44,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,935 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:44,935 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:44,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:44,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,944 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 10:50:44,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,946 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:44,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:44,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,956 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:44,956 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:44,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,960 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:44,960 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:44,961 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:50:44,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:44,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:44,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:44,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:44,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:44,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:44,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:44,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:44,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:44,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:44,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:44,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:44,998 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:44,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,004 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,006 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:45,006 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,007 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:45,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,023 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 10:50:45,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,025 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,025 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,042 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,042 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,047 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:45,047 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,049 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 10:50:45,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,066 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,067 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,071 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,072 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,078 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,084 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,084 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:45,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,086 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:45,086 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,087 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:45,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,096 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 10:50:45,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,098 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,098 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,099 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:45,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,113 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,114 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,114 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:45,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,118 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,118 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:45,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,120 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 10:50:45,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,148 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,148 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,149 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:45,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,154 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,155 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:45,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,158 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,159 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:45,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,163 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,163 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,164 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:45,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,166 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,166 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:45,166 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:45,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:45,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,172 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 10:50:45,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,174 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,176 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,192 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,203 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,204 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:45,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,214 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:50:45,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,251 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,251 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,251 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,252 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,260 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,260 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,261 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,266 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,266 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,267 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,272 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,276 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:45,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,278 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:45,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,279 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:45,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,292 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 10:50:45,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,294 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,294 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,297 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,310 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,310 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,312 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,318 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,318 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:45,318 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,323 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 10:50:45,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,381 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,381 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,383 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,391 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,391 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,392 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,398 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,398 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,399 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,406 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,407 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,408 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:45,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,410 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:45,410 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:45,412 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:45,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,422 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 10:50:45,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,423 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,424 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,425 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,442 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,443 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,443 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,443 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,446 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:45,447 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,448 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:50:45,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,478 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,490 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,490 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,490 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,495 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,495 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,495 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,498 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,499 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:45,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,507 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:45,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,508 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:45,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:45,508 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:45,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,518 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 10:50:45,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,519 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,519 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,520 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:45,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,565 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,565 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:45,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,576 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,576 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-18 10:50:45,576 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,579 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-18 10:50:45,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,695 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,695 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:45,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,711 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,711 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:45,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,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-18 10:50:45,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,719 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,720 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:45,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,730 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:45,732 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:45,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:45,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:45,736 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:45,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:45,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:45,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:45,741 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:45,743 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:50:45,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:45,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:45,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:50:45,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:50:45,771 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-18 10:50:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:46,849 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-18 10:50:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:50:46,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-18 10:50:46,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-18 10:50:46,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-18 10:50:46,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-18 10:50:46,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-18 10:50:46,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-18 10:50:46,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:50:46,871 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-18 10:50:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-18 10:50:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-18 10:50:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 10:50:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-18 10:50:46,906 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 10:50:46,906 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-18 10:50:46,906 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:50:46,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-18 10:50:46,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-18 10:50:46,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:46,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:46,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:46,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:46,909 INFO L794 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-18 10:50:46,909 INFO L796 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 734#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); 875#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 760#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); 695#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 696#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); 844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 634#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; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-18 10:50:46,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:46,910 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 10:50:46,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:46,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:46,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:46,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-18 10:50:46,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:46,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:46,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:46,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:46,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-18 10:50:46,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:46,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:46,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:47,001 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-18 10:50:47,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:50:47,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:50:47,171 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-18 10:50:47,194 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:50:47,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:50:47,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:50:47,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:50:47,195 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:50:47,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:50:47,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:50:47,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:50:47,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label48_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 10:50:47,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:50:47,195 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:50:47,197 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-18 10:50:47,200 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-18 10:50:47,242 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-18 10:50:47,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-18 10:50:47,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-18 10:50:47,257 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-18 10:50:47,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:47,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:50:47,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:50:47,729 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:47,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:47,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:47,752 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:47,752 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:47,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:47,770 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:47,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:47,773 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:47,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:47,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:47,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:47,798 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:47,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:47,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:47,817 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:47,817 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:47,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:47,838 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:47,844 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:47,844 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:47,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:47,867 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:47,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:50:47,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:47,942 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 10:50:47,944 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:50:47,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:50:47,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:50:47,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:50:47,944 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:50:47,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:50:47,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:50:47,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:50:47,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label48_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-18 10:50:47,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:50:47,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:50:47,945 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-18 10:50:47,949 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-18 10:50:47,961 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-18 10:50:47,967 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-18 10:50:47,968 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-18 10:50:47,970 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-18 10:50:47,973 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-18 10:50:47,981 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-18 10:50:48,162 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:50:48,162 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:50:48,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-18 10:50:48,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:48,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:48,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,169 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,169 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:48,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:48,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,174 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,175 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,177 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,177 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:50:48,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:50:48,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,182 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 10:50:48,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,183 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,183 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,185 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,186 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,188 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,188 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,197 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,197 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,198 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,198 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,200 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,201 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,204 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,204 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,208 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,208 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,211 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 10:50:48,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,212 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,212 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,214 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,218 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,218 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,218 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,219 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,220 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,221 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,221 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,223 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,223 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,224 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,231 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,231 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,232 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,237 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,237 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,240 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 10:50:48,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,241 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,242 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,244 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,245 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,248 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,248 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,248 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:48,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,250 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,250 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,252 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,252 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,256 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,256 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,256 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:48,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,260 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,260 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,260 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:48,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:50:48,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,266 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,266 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,277 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 10:50:48,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,278 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,278 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,279 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,279 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,282 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,283 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,288 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,288 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,288 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,290 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,290 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,291 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,292 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,292 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,292 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,293 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,295 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,296 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,296 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,296 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,301 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,301 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,301 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,309 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,309 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 10:50:48,310 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 10:50:48,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,313 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 10:50:48,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,314 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,314 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,315 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,315 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,319 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,320 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,320 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,325 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,325 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,325 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,326 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,328 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,328 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,329 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,330 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,331 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,331 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,334 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,334 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,334 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,335 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,342 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,342 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,342 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,342 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,344 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,355 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 10:50:48,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,355 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,356 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,363 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 10:50:48,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,365 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,365 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,370 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,370 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,371 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,378 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,378 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,378 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,380 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:48,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,391 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,391 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,392 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,394 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,394 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,395 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,400 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,400 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,401 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,401 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,403 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:48,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,413 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,414 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,414 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,416 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 10:50:48,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,441 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,441 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 10:50:48,443 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 10:50:48,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,490 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 10:50:48,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,490 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,491 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,499 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,500 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,500 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,500 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,504 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,504 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,504 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,514 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,517 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,517 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,517 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,519 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,519 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,519 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,520 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,521 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,522 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,522 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,522 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,539 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,539 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,539 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:50:48,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,547 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 10:50:48,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,547 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 10:50:48,548 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:50:48,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,567 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 10:50:48,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,567 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,568 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,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-18 10:50:48,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,573 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,573 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,590 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,590 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,590 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,591 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:50:48,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,593 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,593 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,596 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,597 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,600 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,601 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,602 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:50:48,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,610 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:50:48,610 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,611 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 10:50:48,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:50:48,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 10:50:48,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 10:50:48,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:50:48,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:50:48,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:50:48,657 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 10:50:48,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:50:48,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:50:48,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:50:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:50:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:50:48,680 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-18 10:50:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:49,427 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-18 10:50:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:50:49,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-18 10:50:49,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 10:50:49,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 10:50:49,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-18 10:50:49,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-18 10:50:49,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-18 10:50:49,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:50:49,441 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 10:50:49,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-18 10:50:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 10:50:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 10:50:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-18 10:50:49,459 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 10:50:49,459 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-18 10:50:49,459 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:50:49,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-18 10:50:49,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-18 10:50:49,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:49,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:49,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:49,465 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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, 1, 1, 1] [2018-11-18 10:50:49,465 INFO L794 eck$LassoCheckResult]: Stem: 1797#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 1673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1674#L606-3 [2018-11-18 10:50:49,466 INFO L796 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1904#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1775#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1776#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); 1921#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; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2186#L606-3 assume true; 2184#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2182#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2180#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); 2178#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2176#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); 2174#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2172#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); 2170#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2168#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)); 2166#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); 2164#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); 2162#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); 2160#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2158#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); 2156#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2154#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2152#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2149#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); 2147#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); 2145#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2143#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); 2141#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2139#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2137#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); 2135#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2133#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); 2131#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); 2129#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2127#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2125#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2123#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2121#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); 2119#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2117#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2115#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2113#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); 2111#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2109#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2107#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); 2105#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2103#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); 2101#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); 2099#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2097#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); 2095#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2093#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2091#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)); 2090#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); 2088#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; 1783#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-11-18 10:50:49,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 10:50:49,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:49,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:49,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:49,474 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-18 10:50:49,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:49,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:49,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:49,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:49,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:50:49,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:50:49,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:50:49,643 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:50:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:50:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:50:49,643 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 10:50:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:51,052 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-18 10:50:51,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:50:51,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-18 10:50:51,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-18 10:50:51,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-18 10:50:51,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-18 10:50:51,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-18 10:50:51,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-18 10:50:51,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:50:51,070 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-18 10:50:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-18 10:50:51,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-18 10:50:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-18 10:50:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-18 10:50:51,092 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 10:50:51,094 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-18 10:50:51,094 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:50:51,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-18 10:50:51,099 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-18 10:50:51,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:51,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:51,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:51,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 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-18 10:50:51,105 INFO L794 eck$LassoCheckResult]: Stem: 3690#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-18 10:50:51,106 INFO L796 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4749#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4748#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4747#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); 4746#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3699#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); 3630#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3631#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); 4330#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; 3746#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4312#L606-3 assume true; 4310#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4308#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4306#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; 3670#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4556#L606-3 assume true; 4195#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4186#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4185#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); 4183#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4181#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); 4179#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4177#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); 4175#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4173#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)); 4171#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); 4169#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); 4167#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); 4165#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4163#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); 4161#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4159#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4157#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4155#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); 4153#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); 4151#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4149#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); 4147#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4145#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4143#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); 4141#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4139#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); 4137#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); 4135#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4133#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4131#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4129#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4127#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); 4125#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4123#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4121#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4119#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); 4117#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4115#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4113#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); 4111#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4109#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); 4107#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); 4105#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4103#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); 4101#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4099#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4097#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)); 4095#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); 4092#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; 4093#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-18 10:50:51,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-18 10:50:51,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:51,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:51,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:51,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:51,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:51,123 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-18 10:50:51,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:51,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:51,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:51,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:51,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 10:50:51,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:50:51,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:50:51,169 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:50:51,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:50:51,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:50:51,170 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-18 10:50:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:52,643 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-18 10:50:52,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:50:52,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-18 10:50:52,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-18 10:50:52,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-18 10:50:52,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-18 10:50:52,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-18 10:50:52,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-18 10:50:52,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:50:52,667 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-18 10:50:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-18 10:50:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-18 10:50:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-18 10:50:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-18 10:50:52,692 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 10:50:52,692 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-18 10:50:52,692 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:50:52,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-18 10:50:52,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 10:50:52,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:52,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:52,703 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:52,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 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-18 10:50:52,704 INFO L794 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-18 10:50:52,705 INFO L796 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7623#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7622#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7620#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); 7619#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7617#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); 7615#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7613#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); 7607#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7608#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)); 7604#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); 7605#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); 7760#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); 7758#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7756#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); 7754#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7752#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7750#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7748#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; 6538#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6920#L606-3 assume true; 6918#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6916#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6914#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; 6450#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6922#L606-3 assume true; 6921#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6919#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6917#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); 6915#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6913#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); 6911#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6909#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); 6907#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6905#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)); 6903#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); 6901#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); 6899#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); 6897#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6895#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); 6893#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6891#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6889#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6887#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); 6885#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); 6883#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6881#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); 6879#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6877#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6875#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); 6873#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6871#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); 6869#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); 6867#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6865#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6863#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6861#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6859#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); 6857#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6855#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6853#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6851#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); 6849#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6847#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6845#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); 6843#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6841#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); 6839#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); 6837#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6835#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); 6833#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6831#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6829#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)); 6827#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); 6823#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; 6824#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-18 10:50:52,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-18 10:50:52,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:52,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:52,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:52,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:52,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:52,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-18 10:50:52,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:52,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:52,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 10:50:52,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:50:52,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:50:52,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:50:52,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:50:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:50:52,825 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-18 10:50:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:53,587 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-18 10:50:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:50:53,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-18 10:50:53,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 10:50:53,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 10:50:53,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-18 10:50:53,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-18 10:50:53,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-18 10:50:53,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:50:53,605 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 10:50:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-18 10:50:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-18 10:50:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-18 10:50:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-18 10:50:53,631 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 10:50:53,631 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-18 10:50:53,631 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:50:53,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-18 10:50:53,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-18 10:50:53,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:53,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:53,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:53,641 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, 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-18 10:50:53,641 INFO L794 eck$LassoCheckResult]: Stem: 9451#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-18 10:50:53,641 INFO L796 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10121#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10119#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10118#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); 10116#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10115#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); 10114#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10113#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); 10100#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10101#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)); 10094#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); 10095#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); 10112#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); 10111#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10110#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); 10108#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10106#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10104#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9893#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); 9894#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); 10051#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10049#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); 10047#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10045#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10043#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); 10041#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10039#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); 10037#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); 10035#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9781#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; 9673#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9775#L606-3 assume true; 9773#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9771#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9769#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); 9767#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9765#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); 9763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9761#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); 9759#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9757#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)); 9755#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); 9753#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); 9751#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); 9749#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9747#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); 9745#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9743#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9741#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9739#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); 9737#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); 9735#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9733#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); 9731#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9729#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9727#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); 9725#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9723#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); 9721#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); 9718#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9716#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9714#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9712#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9710#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); 9708#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9706#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9704#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9702#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); 9700#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9698#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9696#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); 9694#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9692#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); 9690#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); 9688#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9686#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); 9684#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9682#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9680#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)); 9678#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); 9675#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; 9676#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-18 10:50:53,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-18 10:50:53,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:53,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:53,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:53,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:53,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:53,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-18 10:50:53,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:53,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:50:53,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:50:53,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:50:53,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:50:53,815 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:50:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:50:53,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:50:53,815 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-18 10:50:54,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:54,126 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-18 10:50:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:50:54,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-18 10:50:54,134 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 10:50:54,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 10:50:54,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-18 10:50:54,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-18 10:50:54,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-18 10:50:54,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:50:54,149 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 10:50:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-18 10:50:54,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-18 10:50:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-18 10:50:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-18 10:50:54,171 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 10:50:54,171 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-18 10:50:54,171 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 10:50:54,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-18 10:50:54,180 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-18 10:50:54,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:54,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:54,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:50:54,183 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, 1] [2018-11-18 10:50:54,183 INFO L794 eck$LassoCheckResult]: Stem: 12457#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-18 10:50:54,184 INFO L796 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13169#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13167#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13165#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); 13163#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13161#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); 13159#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13157#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); 13155#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13153#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)); 13151#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); 13149#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); 13147#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); 13145#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 13143#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); 13142#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 13140#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 13138#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 13136#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); 13134#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); 13132#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 13130#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); 13128#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 13126#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 13124#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); 13122#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13120#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); 13118#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); 13117#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12858#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12859#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13091#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13090#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); 13088#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13086#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13084#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13082#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); 13080#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13078#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13076#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); 13074#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13072#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); 13070#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); 13068#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13066#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); 13064#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13062#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13060#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)); 13058#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); 13056#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); 13054#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 13052#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); 13050#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 13048#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13046#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); 13044#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); 13042#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13040#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13038#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); 13036#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13034#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); 13032#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); 13030#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 13028#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)); 13026#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 13024#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); 13022#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 13020#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)); 13018#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 13016#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 13014#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 13012#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)); 13010#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13008#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)); 13006#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 13004#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 13002#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 13000#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); 12998#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12996#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12994#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12992#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12990#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12988#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12986#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12984#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12982#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12354#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13276#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13274#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13272#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13270#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13268#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13266#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13264#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13262#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13260#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12549#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13257#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13255#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13253#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13251#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13249#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13247#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13245#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13243#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13241#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13239#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13237#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13235#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13233#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13231#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13229#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13226#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13224#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13222#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13220#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13218#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13216#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13214#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13212#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13210#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13208#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13206#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13204#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13202#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13200#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13198#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13196#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13194#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13192#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13190#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13188#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13186#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13184#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13182#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13180#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13178#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13176#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13174#L594-1 calculate_output_#res := -2; 13172#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-18 10:50:54,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-18 10:50:54,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:54,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:54,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:54,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:54,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:54,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:54,205 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-18 10:50:54,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:54,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:54,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:54,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:54,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:54,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:54,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-18 10:50:54,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:54,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:54,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:54,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:54,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:50:54,698 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-18 10:50:54,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:50:54,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 10:50:55,649 WARN L180 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-18 10:50:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 10:50:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-18 10:50:55,722 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-18 10:50:56,148 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-18 10:50:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:50:56,734 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-18 10:50:56,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 10:50:56,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-18 10:50:56,739 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-18 10:50:56,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-18 10:50:56,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-18 10:50:56,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-18 10:50:56,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-18 10:50:56,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:50:56,746 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-18 10:50:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-18 10:50:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-18 10:50:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-18 10:50:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-18 10:50:56,771 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 10:50:56,771 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-18 10:50:56,772 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 10:50:56,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-18 10:50:56,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-18 10:50:56,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:50:56,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:50:56,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:56,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:50:56,782 INFO L794 eck$LassoCheckResult]: Stem: 15664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16355#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16353#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16351#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); 16349#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; 15805#L597 [2018-11-18 10:50:56,782 INFO L796 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16277#L606-3 assume true; 16275#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16273#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16271#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); 16269#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16267#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); 16265#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16263#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; 15805#L597 [2018-11-18 10:50:56,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:56,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-18 10:50:56,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:56,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:56,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:56,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:56,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:56,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-18 10:50:56,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:56,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:56,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:56,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:56,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:56,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:50:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-18 10:50:56,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:50:56,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:50:56,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:56,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:50:56,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:50:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:50:56,934 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-11-18 10:50:57,070 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:50:57,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:50:57,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:50:57,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:50:57,071 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 10:50:57,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:50:57,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:50:57,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:50:57,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label48_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-18 10:50:57,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:50:57,071 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:50:57,073 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-18 10:50:57,084 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-18 10:50:57,087 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-18 10:50:57,089 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-18 10:50:57,091 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-18 10:50:57,094 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-18 10:50:57,097 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-18 10:50:57,100 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-18 10:50:57,102 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-18 10:50:57,106 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-18 10:50:57,108 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-18 10:50:57,110 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-18 10:50:57,112 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-18 10:50:57,115 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-18 10:50:57,118 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-18 10:50:57,120 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-18 10:50:57,128 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-18 10:50:57,135 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-18 10:50:57,142 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-18 10:50:57,145 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-18 10:50:57,148 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-18 10:50:57,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:50:57,303 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,309 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,310 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,327 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,333 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,333 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,350 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,351 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,352 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,372 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,390 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,393 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,393 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,415 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,415 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,437 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,437 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,439 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,439 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,455 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,457 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,457 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,477 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,477 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,502 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,503 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,503 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,529 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,529 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,548 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,548 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,567 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,590 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,590 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,608 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,611 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,611 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,633 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:50:57,657 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,858 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,876 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,876 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:57,881 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:57,881 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:57,897 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:57,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 10:50:57,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:58,063 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:58,064 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:58,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:58,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:58,083 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:58,083 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:58,100 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:58,100 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:58,103 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:58,103 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_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/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-18 10:50:58,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 10:50:58,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 10:50:58,124 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 10:50:58,124 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-18 10:50:58,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:50:58 BoogieIcfgContainer [2018-11-18 10:50:58,167 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:50:58,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:50:58,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:50:58,168 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:50:58,169 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:42" (3/4) ... [2018-11-18 10:50:58,172 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 10:50:58,209 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a81aa8e6-0081-4bfd-8a7c-b8eed0e8bad4/bin-2019/uautomizer/witness.graphml [2018-11-18 10:50:58,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:50:58,210 INFO L168 Benchmark]: Toolchain (without parser) took 20476.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 954.3 MB in the beginning and 934.3 MB in the end (delta: 20.0 MB). Peak memory consumption was 351.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:50:58,210 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:50:58,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.18 ms. Allocated memory is still 1.0 GB. Free memory was 954.3 MB in the beginning and 919.4 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:50:58,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 919.4 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-18 10:50:58,211 INFO L168 Benchmark]: Boogie Preprocessor took 42.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:50:58,211 INFO L168 Benchmark]: RCFGBuilder took 4100.30 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: 100.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:50:58,212 INFO L168 Benchmark]: BuchiAutomizer took 15684.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 934.3 MB in the end (delta: 109.7 MB). Peak memory consumption was 340.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:50:58,212 INFO L168 Benchmark]: Witness Printer took 41.12 ms. Allocated memory is still 1.4 GB. Free memory is still 934.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:50:58,214 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.18 ms. Allocated memory is still 1.0 GB. Free memory was 954.3 MB in the beginning and 919.4 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 919.4 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4100.30 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: 100.8 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15684.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.3 MB). Free memory was 1.0 GB in the beginning and 934.3 MB in the end (delta: 109.7 MB). Peak memory consumption was 340.6 MB. Max. memory is 11.5 GB. * Witness Printer took 41.12 ms. Allocated memory is still 1.4 GB. Free memory is still 934.3 MB. 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 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.6s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 8.3s. Construction of modules took 5.6s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3081 SDslu, 489 SDs, 0 SdLazy, 3702 SolverSat, 847 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.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: 125ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bca1341=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e22a134=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@1bca1341=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e22a134=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@1bca1341=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@e22a134=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [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] RET, EXPR calculate_output(input) [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)) [L614] CALL calculate_output(input) [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...