./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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 f8826e63977e5204bfb153113fa32b1df4948bea .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 03:33:18,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:33:18,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:33:18,337 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:33:18,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:33:18,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:33:18,339 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:33:18,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:33:18,341 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:33:18,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:33:18,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:33:18,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:33:18,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:33:18,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:33:18,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:33:18,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:33:18,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:33:18,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:33:18,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:33:18,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:33:18,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:33:18,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:33:18,353 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:33:18,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:33:18,353 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:33:18,354 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:33:18,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:33:18,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:33:18,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:33:18,356 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:33:18,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:33:18,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:33:18,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:33:18,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:33:18,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:33:18,359 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:33:18,359 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:33:18,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:33:18,371 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:33:18,371 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:33:18,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:33:18,372 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:33:18,372 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:33:18,372 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:33:18,372 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:33:18,372 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:33:18,373 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:33:18,373 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:33:18,373 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:33:18,373 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:33:18,373 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:33:18,373 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:33:18,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:33:18,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:33:18,374 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:33:18,374 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:33:18,374 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:33:18,374 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:33:18,374 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:33:18,374 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:33:18,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:33:18,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:33:18,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:33:18,375 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:33:18,375 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:33:18,375 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:33:18,375 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:33:18,376 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:33:18,376 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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 -> f8826e63977e5204bfb153113fa32b1df4948bea [2018-11-10 03:33:18,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:33:18,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:33:18,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:33:18,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:33:18,410 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:33:18,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c [2018-11-10 03:33:18,448 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/data/3986e2947/a6d9bb2ee36a46c9b55c1da89b3df6b3/FLAG9202fe4b5 [2018-11-10 03:33:18,891 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:33:18,892 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/sv-benchmarks/c/eca-rers2012/Problem02_label28_true-unreach-call_false-termination.c [2018-11-10 03:33:18,900 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/data/3986e2947/a6d9bb2ee36a46c9b55c1da89b3df6b3/FLAG9202fe4b5 [2018-11-10 03:33:18,912 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/data/3986e2947/a6d9bb2ee36a46c9b55c1da89b3df6b3 [2018-11-10 03:33:18,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:33:18,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:33:18,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:33:18,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:33:18,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:33:18,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:18" (1/1) ... [2018-11-10 03:33:18,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505fd6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:18, skipping insertion in model container [2018-11-10 03:33:18,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:18" (1/1) ... [2018-11-10 03:33:18,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:33:18,963 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:33:19,206 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:33:19,209 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:33:19,277 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:33:19,289 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:33:19,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19 WrapperNode [2018-11-10 03:33:19,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:33:19,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:33:19,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:33:19,291 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:33:19,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:33:19,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:33:19,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:33:19,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:33:19,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... [2018-11-10 03:33:19,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:33:19,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:33:19,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:33:19,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:33:19,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:19,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:33:19,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:33:20,342 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:33:20,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:33:20 BoogieIcfgContainer [2018-11-10 03:33:20,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:33:20,343 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:33:20,343 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:33:20,346 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:33:20,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:33:20,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:33:18" (1/3) ... [2018-11-10 03:33:20,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a59738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:33:20, skipping insertion in model container [2018-11-10 03:33:20,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:33:20,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:19" (2/3) ... [2018-11-10 03:33:20,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a59738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:33:20, skipping insertion in model container [2018-11-10 03:33:20,348 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:33:20,348 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:33:20" (3/3) ... [2018-11-10 03:33:20,350 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label28_true-unreach-call_false-termination.c [2018-11-10 03:33:20,392 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:33:20,392 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:33:20,392 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:33:20,392 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:33:20,393 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:33:20,393 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:33:20,393 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:33:20,393 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:33:20,393 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:33:20,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 03:33:20,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 03:33:20,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:20,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:20,442 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:20,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:33:20,443 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:33:20,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 03:33:20,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 03:33:20,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:20,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:20,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:20,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:33:20,456 INFO L793 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-10 03:33:20,456 INFO L795 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 !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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 ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~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-10 03:33:20,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 03:33:20,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:20,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:20,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:20,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:20,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 03:33:20,552 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:20,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:20,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:20,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:20,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 03:33:20,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:20,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:20,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:20,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:20,639 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-10 03:33:20,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:33:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:33:20,781 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-10 03:33:20,847 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:33:20,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:33:20,848 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:33:20,848 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:33:20,848 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:33:20,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:33:20,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:33:20,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:33:20,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 03:33:20,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:33:20,849 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:33:20,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:20,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:20,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:20,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:20,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-10 03:33:20,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:20,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:20,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,185 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:33:21,186 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,225 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:21,225 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,272 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:21,272 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,327 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:21,328 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,336 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,336 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,341 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:21,341 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,406 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:21,406 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:33:21,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,413 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:21,413 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,437 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:21,437 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:21,456 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:21,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:33:21,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:21,536 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:33:21,537 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:33:21,537 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:33:21,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:33:21,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:33:21,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:33:21,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:33:21,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:33:21,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:33:21,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 03:33:21,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:33:21,539 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:33:21,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:21,735 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:33:21,738 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:33:21,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:21,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:21,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,759 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:21,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:21,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:21,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:21,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:21,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:21,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,802 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:21,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:21,803 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:21,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,807 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:33:21,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,809 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,810 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:21,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,821 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,821 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:21,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,827 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:21,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,830 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:33:21,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,848 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,848 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:21,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,870 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,871 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:21,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,874 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,874 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:21,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,876 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,878 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,878 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:21,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,880 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:21,880 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:21,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:21,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,885 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:33:21,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,886 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,887 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:21,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,895 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:21,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,902 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:21,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,906 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:33:21,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,922 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,923 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:21,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,930 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,930 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:21,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,936 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:21,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,940 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:21,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,941 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:21,942 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:21,942 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:21,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,948 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:33:21,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,949 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,950 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:21,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,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-10 03:33:21,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,956 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,957 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:21,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,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-10 03:33:21,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,960 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:21,960 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,962 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:33:21,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,976 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,977 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:21,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,981 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:21,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,984 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,984 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:21,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:21,990 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,991 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:21,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:21,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:21,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:21,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:21,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:21,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:21,992 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:21,992 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:21,993 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:21,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,001 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:33:22,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,002 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,003 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:22,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,015 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,016 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,016 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:22,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,019 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,020 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,020 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:22,020 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,022 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:33:22,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,047 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,048 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:22,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,051 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,052 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,052 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:22,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,056 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,056 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:22,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,059 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,059 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,059 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,060 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:22,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,061 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,062 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:22,062 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:22,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:22,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,067 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:33:22,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,068 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,070 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,081 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,082 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,082 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,086 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,087 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:22,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,089 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:33:22,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,113 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,113 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,114 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,115 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,119 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,120 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,121 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,121 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,125 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,125 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,126 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,128 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,129 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,129 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,130 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,132 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:22,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,132 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:22,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,133 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:22,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,139 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:33:22,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,140 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,141 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,143 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:22,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,150 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,151 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,152 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:22,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,156 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:22,156 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,160 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:33:22,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,189 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,189 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,191 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:22,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,196 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,196 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,197 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:22,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,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-10 03:33:22,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,201 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,202 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,202 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:22,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,207 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,207 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,208 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:22,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,209 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,210 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:22,210 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:22,212 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:22,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,218 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:33:22,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,219 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,220 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,228 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,228 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,229 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,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-10 03:33:22,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,231 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,231 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:22,231 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,233 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:33:22,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,248 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,249 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,255 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,257 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,258 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,258 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,261 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,261 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,261 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:22,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,264 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:22,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,264 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:22,264 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:22,265 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:22,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,271 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:33:22,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-10 03:33:22,271 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,272 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,272 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:22,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,297 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,297 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,298 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:22,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,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-10 03:33:22,302 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,302 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,302 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 03:33:22,302 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,305 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 03:33:22,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,364 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:22,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,374 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,374 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,374 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:22,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,378 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,378 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:22,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,382 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:22,382 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:22,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:22,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:22,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:22,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:22,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:22,386 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:22,386 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:22,387 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:33:22,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:22,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:22,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:33:22,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:33:22,407 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 03:33:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:22,962 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 03:33:22,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:33:22,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 03:33:22,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 03:33:22,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 03:33:22,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 03:33:22,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 03:33:22,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 03:33:22,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:33:22,980 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 03:33:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 03:33:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 03:33:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 03:33:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 03:33:23,012 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 03:33:23,012 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 03:33:23,012 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:33:23,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 03:33:23,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 03:33:23,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:23,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:23,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:23,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:33:23,014 INFO L793 eck$LassoCheckResult]: Stem: 749#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; 629#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; 630#L606-3 [2018-11-10 03:33:23,015 INFO L795 eck$LassoCheckResult]: Loop: 630#L606-3 assume true; 848#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 731#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 732#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 872#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 758#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 694#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 695#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 843#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 631#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 632#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 630#L606-3 [2018-11-10 03:33:23,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 03:33:23,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:23,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:23,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:23,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 03:33:23,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:23,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:23,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:23,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:33:23,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:23,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 03:33:23,031 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:23,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:23,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:23,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:23,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:23,048 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-10 03:33:23,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:33:23,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:33:23,123 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:33:23,123 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:33:23,123 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:33:23,123 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:33:23,123 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:33:23,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:33:23,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:33:23,124 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:33:23,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 03:33:23,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:33:23,124 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:33:23,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,253 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:33:23,253 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:23,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:23,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:23,292 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:23,292 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:23,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:23,298 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:23,301 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:23,301 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:23,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:23,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:23,323 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:23,323 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:23,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:23,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:23,356 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:23,356 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:23,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:23,384 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:23,408 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:23,408 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:23,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:23,414 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:23,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:33:23,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:23,545 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:33:23,546 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:33:23,546 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:33:23,547 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:33:23,547 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:33:23,547 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:33:23,547 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:33:23,547 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:33:23,547 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:33:23,547 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 03:33:23,547 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:33:23,547 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:33:23,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:23,722 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:33:23,722 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:33:23,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:23,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,724 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:23,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,726 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,726 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:23,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:23,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,745 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,745 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:33:23,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:33:23,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,750 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:33:23,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,751 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,751 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,753 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,755 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,755 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:23,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,757 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,757 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,758 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,758 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,760 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,760 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:23,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:23,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,767 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,768 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,770 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:33:23,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,773 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,773 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,776 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,776 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,779 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,781 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,782 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,785 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,785 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,790 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,790 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,793 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:33:23,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,794 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,796 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,797 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,800 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,800 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,800 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:23,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,801 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,802 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,803 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,803 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,805 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,805 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,806 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:23,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,809 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,809 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,810 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:23,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:33:23,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,815 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,816 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,819 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:33:23,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,820 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,820 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,823 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,824 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,827 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,827 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:23,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,829 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,829 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,830 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,831 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,831 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,831 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,834 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,834 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,834 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:23,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,838 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,839 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,839 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:23,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,846 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,846 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,846 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:33:23,847 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:33:23,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,850 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:33:23,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-10 03:33:23,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,851 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,852 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,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-10 03:33:23,855 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,855 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,856 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,860 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,860 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,861 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,863 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,863 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,865 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,865 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,866 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,869 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,869 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,870 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,876 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,876 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,876 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,878 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,890 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,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-10 03:33:23,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,891 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:33:23,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,893 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,898 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:33:23,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,899 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,905 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,906 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,907 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,921 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,922 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,922 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,923 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:23,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,924 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,925 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,925 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,927 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,927 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,927 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,928 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,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-10 03:33:23,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,932 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,932 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,932 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,934 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:23,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,943 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,944 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,944 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,946 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 03:33:23,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,969 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:23,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,970 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:33:23,971 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:33:23,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,980 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:33:23,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,981 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,981 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,981 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,982 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,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-10 03:33:23,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,988 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,989 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,989 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,991 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,992 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,992 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:23,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:23,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:23,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:23,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:23,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:23,997 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:23,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:23,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:23,997 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:23,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:23,998 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:23,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,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-10 03:33:24,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:24,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,003 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:24,003 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:24,004 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:33:24,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,010 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:33:24,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:24,011 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:33:24,011 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:33:24,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,017 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:33:24,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:24,018 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:24,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,022 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:24,022 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:24,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,029 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,029 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:24,029 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,031 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:33:24,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,033 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,033 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:24,034 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:24,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,037 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:24,037 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:24,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,041 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,041 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:24,041 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,042 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:33:24,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:33:24,050 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,052 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:33:24,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:33:24,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:33:24,080 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:33:24,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:33:24,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:33:24,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:33:24,081 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:33:24,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:33:24,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:33:24,112 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:33:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:33:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:33:24,113 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 03:33:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:24,516 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-11-10 03:33:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:33:24,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-11-10 03:33:24,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 03:33:24,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 03:33:24,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 03:33:24,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 03:33:24,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-11-10 03:33:24,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:33:24,527 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 03:33:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-11-10 03:33:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 03:33:24,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 03:33:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-11-10 03:33:24,545 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 03:33:24,545 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-11-10 03:33:24,545 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:33:24,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-11-10 03:33:24,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 03:33:24,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:24,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:24,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:24,555 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-10 03:33:24,555 INFO L793 eck$LassoCheckResult]: Stem: 1793#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; 1670#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; 1671#L606-3 [2018-11-10 03:33:24,556 INFO L795 eck$LassoCheckResult]: Loop: 1671#L606-3 assume true; 1901#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1773#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 1774#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1923#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1682#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2293#L606-3 assume true; 2292#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2290#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 2289#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2288#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2287#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2286#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2285#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2284#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2283#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2282#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2280#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2278#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2276#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2274#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2273#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2272#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2014#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2015#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2281#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2279#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2277#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2275#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2012#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2013#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2267#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2265#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2263#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2262#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2260#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2258#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2016#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2017#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2121#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2119#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2117#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2115#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2113#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2111#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2109#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2107#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2105#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2104#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2103#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2102#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2101#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2100#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2098#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2096#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2094#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1815#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1671#L606-3 [2018-11-10 03:33:24,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 03:33:24,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:24,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:24,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:24,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:24,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:24,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 03:33:24,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:24,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:24,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:33:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:24,640 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-10 03:33:24,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:33:24,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:33:24,641 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:33:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:33:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:33:24,641 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 03:33:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:25,426 INFO L93 Difference]: Finished difference Result 1228 states and 1699 transitions. [2018-11-10 03:33:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:33:25,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1699 transitions. [2018-11-10 03:33:25,431 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 03:33:25,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1699 transitions. [2018-11-10 03:33:25,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 03:33:25,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 03:33:25,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1699 transitions. [2018-11-10 03:33:25,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:33:25,437 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1699 transitions. [2018-11-10 03:33:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1699 transitions. [2018-11-10 03:33:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 03:33:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 03:33:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1693 transitions. [2018-11-10 03:33:25,451 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 03:33:25,451 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1693 transitions. [2018-11-10 03:33:25,452 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:33:25,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1693 transitions. [2018-11-10 03:33:25,455 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 03:33:25,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:25,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:25,457 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:25,457 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-10 03:33:25,457 INFO L793 eck$LassoCheckResult]: Stem: 3695#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; 3565#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; 3566#L606-3 [2018-11-10 03:33:25,458 INFO L795 eck$LassoCheckResult]: Loop: 3566#L606-3 assume true; 4660#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4656#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4652#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4648#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4645#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4643#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3827#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 3805#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3577#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3821#L606-3 assume true; 3814#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3674#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 3675#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3665#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4695#L606-3 assume true; 4694#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4692#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 4690#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4688#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4680#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4681#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4721#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4720#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4719#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4718#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4717#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4716#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4715#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4714#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4713#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4711#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4710#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4709#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4708#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4706#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4704#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4702#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4700#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4679#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 3669#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 3670#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 3671#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 3672#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 3673#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 3589#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 3590#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 3844#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 3644#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 3645#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3676#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 3598#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 3600#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 3677#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 3603#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 3605#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 3658#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 3624#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 3625#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 3736#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 3737#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 3794#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 3661#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 3662#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 3663#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3682#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3566#L606-3 [2018-11-10 03:33:25,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 03:33:25,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:25,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:25,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 03:33:25,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:25,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:33:25,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:25,493 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-10 03:33:25,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:33:25,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:33:25,494 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:33:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:33:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:33:25,494 INFO L87 Difference]: Start difference. First operand 1225 states and 1693 transitions. cyclomatic complexity: 470 Second operand 3 states. [2018-11-10 03:33:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:25,845 INFO L93 Difference]: Finished difference Result 1509 states and 2002 transitions. [2018-11-10 03:33:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:33:25,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2002 transitions. [2018-11-10 03:33:25,851 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 03:33:25,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2002 transitions. [2018-11-10 03:33:25,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 03:33:25,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 03:33:25,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2002 transitions. [2018-11-10 03:33:25,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:33:25,858 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2002 transitions. [2018-11-10 03:33:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2002 transitions. [2018-11-10 03:33:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 03:33:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 03:33:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2000 transitions. [2018-11-10 03:33:25,871 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 03:33:25,871 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2000 transitions. [2018-11-10 03:33:25,871 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:33:25,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2000 transitions. [2018-11-10 03:33:25,875 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 03:33:25,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:25,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:25,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:25,876 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-10 03:33:25,877 INFO L793 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; 6305#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; 6306#L606-3 [2018-11-10 03:33:25,877 INFO L795 eck$LassoCheckResult]: Loop: 6306#L606-3 assume true; 7667#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7663#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 7618#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7598#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7582#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7581#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7580#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7578#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7576#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7574#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7572#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7570#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7568#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7301#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7300#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7298#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7296#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7295#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6543#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7198#L606-3 assume true; 7312#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7310#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 7189#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6452#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7525#L606-3 assume true; 7523#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7521#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 7519#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7517#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7436#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7437#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7723#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7721#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7718#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7716#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7713#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7709#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7705#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7701#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7697#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7687#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7019#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7020#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 7203#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 7385#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7383#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 7381#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7378#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7376#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 7373#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7370#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 7369#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 7368#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7367#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7365#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7363#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7361#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 7359#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7357#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7355#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7354#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 7352#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7350#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7348#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 7346#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7344#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 7342#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 7340#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7338#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 7336#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7025#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7014#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 7011#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 7009#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6456#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6306#L606-3 [2018-11-10 03:33:25,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 03:33:25,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:25,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 03:33:25,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:33:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:25,914 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-10 03:33:25,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:33:25,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:33:25,914 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:33:25,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:33:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:33:25,915 INFO L87 Difference]: Start difference. First operand 1508 states and 2000 transitions. cyclomatic complexity: 494 Second operand 3 states. [2018-11-10 03:33:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:26,234 INFO L93 Difference]: Finished difference Result 1507 states and 1822 transitions. [2018-11-10 03:33:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:33:26,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1822 transitions. [2018-11-10 03:33:26,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 03:33:26,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 03:33:26,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 03:33:26,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 03:33:26,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1822 transitions. [2018-11-10 03:33:26,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:33:26,245 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 03:33:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1822 transitions. [2018-11-10 03:33:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 03:33:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 03:33:26,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1822 transitions. [2018-11-10 03:33:26,257 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 03:33:26,257 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1822 transitions. [2018-11-10 03:33:26,257 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:33:26,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1822 transitions. [2018-11-10 03:33:26,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 03:33:26,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:26,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:26,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:26,262 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-10 03:33:26,263 INFO L793 eck$LassoCheckResult]: Stem: 9450#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; 9326#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; 9327#L606-3 [2018-11-10 03:33:26,263 INFO L795 eck$LassoCheckResult]: Loop: 9327#L606-3 assume true; 10151#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10149#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 10147#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10145#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10143#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10141#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10139#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10138#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10137#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10135#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10133#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10131#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10130#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10128#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10127#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10126#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10124#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9896#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9897#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10268#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10266#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10264#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10263#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10262#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10261#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10260#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10258#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10256#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 10254#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9699#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9852#L606-3 assume true; 9850#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9848#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 9846#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9844#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9842#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9840#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9838#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9836#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9833#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9831#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9829#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9827#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9825#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9823#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9821#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9819#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9817#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9815#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9813#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9811#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9809#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9807#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9805#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9803#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9801#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9799#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9797#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9795#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9793#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9791#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9789#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9787#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9785#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9783#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9781#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9779#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9777#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9775#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9773#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9771#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9769#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9766#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9764#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9762#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9760#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9758#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9756#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9754#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9751#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9752#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9327#L606-3 [2018-11-10 03:33:26,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:26,263 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 03:33:26,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:26,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:26,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:26,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:26,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:26,267 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 03:33:26,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:26,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:33:26,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:26,325 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-10 03:33:26,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:33:26,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:33:26,326 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:33:26,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:33:26,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:33:26,326 INFO L87 Difference]: Start difference. First operand 1507 states and 1822 transitions. cyclomatic complexity: 317 Second operand 3 states. [2018-11-10 03:33:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:26,505 INFO L93 Difference]: Finished difference Result 1496 states and 1778 transitions. [2018-11-10 03:33:26,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:33:26,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1778 transitions. [2018-11-10 03:33:26,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 03:33:26,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 03:33:26,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 03:33:26,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 03:33:26,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1778 transitions. [2018-11-10 03:33:26,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:33:26,516 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 03:33:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1778 transitions. [2018-11-10 03:33:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 03:33:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 03:33:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1778 transitions. [2018-11-10 03:33:26,528 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 03:33:26,528 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1778 transitions. [2018-11-10 03:33:26,528 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:33:26,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1778 transitions. [2018-11-10 03:33:26,532 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 03:33:26,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:26,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:26,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:33:26,533 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-10 03:33:26,533 INFO L793 eck$LassoCheckResult]: Stem: 12455#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; 12335#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; 12336#L606-3 [2018-11-10 03:33:26,534 INFO L795 eck$LassoCheckResult]: Loop: 12336#L606-3 assume true; 13237#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13235#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 13233#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13231#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13229#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13227#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13225#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13182#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13183#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13220#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13218#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13216#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13214#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13212#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13211#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13209#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13207#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13205#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13203#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13201#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13198#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13196#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13194#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13192#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13190#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13188#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13186#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13184#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12844#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12845#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13144#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13142#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13140#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13138#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13136#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13134#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13132#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13130#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13128#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13126#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13124#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13122#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13120#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13118#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13116#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12842#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12843#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13424#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13422#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13420#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13418#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13416#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13414#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13412#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13410#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13408#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13406#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13404#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13402#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13400#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13398#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13396#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13394#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13392#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13390#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13388#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13386#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13384#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13382#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13380#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13378#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13376#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13374#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13372#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13370#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13368#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13366#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13364#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13362#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13360#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13358#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13356#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13354#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13352#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13350#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13348#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12352#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13345#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13343#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13341#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13339#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13337#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13335#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13333#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13331#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13329#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13326#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13324#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13322#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13320#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13318#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13316#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13314#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13312#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13310#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13308#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13306#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13304#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13302#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13301#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13299#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13297#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13294#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13292#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13290#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13288#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13286#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13284#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13282#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13280#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13278#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13276#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13274#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13272#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13270#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13268#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13266#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13264#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13262#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13260#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13258#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13256#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13254#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13252#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13250#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13248#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13246#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13244#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13242#L594-1 calculate_output_#res := -2; 13240#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12336#L606-3 [2018-11-10 03:33:26,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 03:33:26,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:26,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:26,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:26,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 03:33:26,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:26,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:26,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 03:33:26,573 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:26,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:33:26,906 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-10 03:33:26,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:33:26,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 03:33:27,593 WARN L179 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 03:33:27,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:33:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:33:27,656 INFO L87 Difference]: Start difference. First operand 1496 states and 1778 transitions. cyclomatic complexity: 285 Second operand 10 states. [2018-11-10 03:33:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:33:28,445 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-10 03:33:28,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:33:28,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-10 03:33:28,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 03:33:28,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-10 03:33:28,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 03:33:28,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 03:33:28,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-10 03:33:28,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:33:28,459 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-10 03:33:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-10 03:33:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 03:33:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 03:33:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-10 03:33:28,473 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 03:33:28,473 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 03:33:28,474 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:33:28,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-10 03:33:28,478 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 03:33:28,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:33:28,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:33:28,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:33:28,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:33:28,480 INFO L793 eck$LassoCheckResult]: Stem: 15661#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; 15544#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; 15545#L606-3 assume true; 16908#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16905#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 16901#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16896#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15804#L597 [2018-11-10 03:33:28,480 INFO L795 eck$LassoCheckResult]: Loop: 15804#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 17067#L606-3 assume true; 17066#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17065#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);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; 17064#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 17063#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 17062#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 17061#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 17060#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15804#L597 [2018-11-10 03:33:28,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 03:33:28,480 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:28,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:28,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:28,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 03:33:28,487 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:28,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:28,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:28,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:28,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:28,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:33:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 03:33:28,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:33:28,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:33:28,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:28,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:33:28,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:33:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:33:28,695 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:33:28,695 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:33:28,695 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:33:28,695 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:33:28,695 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:33:28,695 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:33:28,695 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:33:28,695 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:33:28,696 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label28_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 03:33:28,696 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:33:28,696 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:33:28,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:33:28,877 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:33:28,877 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:28,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:28,881 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:28,883 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:28,883 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:28,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:28,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:28,915 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:28,915 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:28,919 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:28,919 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:28,924 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:28,924 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:28,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:28,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:28,947 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:28,947 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:28,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:28,974 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:28,976 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:28,976 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:28,993 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:28,994 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,010 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,010 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,016 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,016 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,032 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,032 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,047 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,047 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,072 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,072 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,077 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,077 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,109 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,109 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,127 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,127 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,133 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,134 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,153 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,153 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,184 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,185 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,187 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:33:29,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,414 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,414 INFO L446 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=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,430 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,433 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,433 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,449 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:33:29,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,616 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,616 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,652 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,652 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,655 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,657 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,657 INFO L446 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_3e86718d-5fb4-402b-9f41-fe9c79f28347/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-10 03:33:29,674 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:33:29,674 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:33:29,677 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:33:29,677 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 03:33:29,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:33:29 BoogieIcfgContainer [2018-11-10 03:33:29,712 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:33:29,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:33:29,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:33:29,713 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:33:29,713 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:33:20" (3/4) ... [2018-11-10 03:33:29,716 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 03:33:29,751 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3e86718d-5fb4-402b-9f41-fe9c79f28347/bin-2019/uautomizer/witness.graphml [2018-11-10 03:33:29,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:33:29,752 INFO L168 Benchmark]: Toolchain (without parser) took 10837.15 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.7 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -109.6 MB). Peak memory consumption was 392.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:33:29,752 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:33:29,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 916.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:33:29,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 916.9 MB in the beginning and 1.2 GB in the end (delta: -233.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 03:33:29,753 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 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.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:33:29,753 INFO L168 Benchmark]: RCFGBuilder took 910.62 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: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:33:29,754 INFO L168 Benchmark]: BuchiAutomizer took 9368.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -28.0 MB). Peak memory consumption was 532.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:33:29,754 INFO L168 Benchmark]: Witness Printer took 38.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:33:29,756 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.18 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 916.9 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 103.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 916.9 MB in the beginning and 1.2 GB in the end (delta: -233.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.20 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.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 910.62 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: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9368.96 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 341.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -28.0 MB). Peak memory consumption was 532.9 MB. Max. memory is 11.5 GB. * Witness Printer took 38.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.6s. Construction of modules took 2.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 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, 2.4s 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: 61ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - 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@739718d9=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4443e941=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@739718d9=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4443e941=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@739718d9=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@4443e941=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 4 + -4*0^k + -4*k + -5*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 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 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...