./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/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 a0942677612f90fad3f45a67c18b7387cde689b6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:23:19,620 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:23:19,622 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:23:19,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:23:19,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:23:19,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:23:19,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:23:19,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:23:19,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:23:19,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:23:19,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:23:19,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:23:19,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:23:19,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:23:19,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:23:19,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:23:19,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:23:19,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:23:19,642 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:23:19,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:23:19,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:23:19,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:23:19,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:23:19,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:23:19,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:23:19,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:23:19,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:23:19,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:23:19,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:23:19,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:23:19,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:23:19,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:23:19,652 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:23:19,652 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:23:19,653 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:23:19,654 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:23:19,654 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 13:23:19,666 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:23:19,666 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:23:19,667 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:23:19,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:23:19,667 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:23:19,668 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 13:23:19,668 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 13:23:19,668 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 13:23:19,668 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 13:23:19,668 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 13:23:19,668 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 13:23:19,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:23:19,669 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:23:19,669 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:23:19,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:23:19,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:23:19,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:23:19,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 13:23:19,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 13:23:19,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 13:23:19,670 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:23:19,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:23:19,670 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 13:23:19,670 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:23:19,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 13:23:19,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:23:19,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:23:19,671 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 13:23:19,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:23:19,671 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:23:19,671 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 13:23:19,672 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 13:23:19,672 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_3eada402-97f5-4cd7-be6d-a37a95696de5/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 -> a0942677612f90fad3f45a67c18b7387cde689b6 [2018-11-18 13:23:19,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:23:19,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:23:19,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:23:19,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:23:19,706 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:23:19,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 13:23:19,746 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/data/e96240d6c/2688c904fc7b477a9ca55c55bbab52b0/FLAGfd633b801 [2018-11-18 13:23:20,125 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:23:20,126 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 13:23:20,133 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/data/e96240d6c/2688c904fc7b477a9ca55c55bbab52b0/FLAGfd633b801 [2018-11-18 13:23:20,145 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/data/e96240d6c/2688c904fc7b477a9ca55c55bbab52b0 [2018-11-18 13:23:20,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:23:20,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:23:20,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:23:20,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:23:20,154 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:23:20,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e3d15d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20, skipping insertion in model container [2018-11-18 13:23:20,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:23:20,204 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:23:20,389 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:23:20,396 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:23:20,474 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:23:20,489 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:23:20,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20 WrapperNode [2018-11-18 13:23:20,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:23:20,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:23:20,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:23:20,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:23:20,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:23:20,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:23:20,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:23:20,550 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:23:20,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... [2018-11-18 13:23:20,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:23:20,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:23:20,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:23:20,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:23:20,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:20,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:23:20,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:23:21,689 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:23:21,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:23:21 BoogieIcfgContainer [2018-11-18 13:23:21,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:23:21,690 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 13:23:21,690 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 13:23:21,692 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 13:23:21,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:23:21,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 01:23:20" (1/3) ... [2018-11-18 13:23:21,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11925fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:23:21, skipping insertion in model container [2018-11-18 13:23:21,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:23:21,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:23:20" (2/3) ... [2018-11-18 13:23:21,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11925fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 01:23:21, skipping insertion in model container [2018-11-18 13:23:21,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 13:23:21,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:23:21" (3/3) ... [2018-11-18 13:23:21,696 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-18 13:23:21,734 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:23:21,735 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 13:23:21,735 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 13:23:21,735 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 13:23:21,735 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:23:21,735 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:23:21,735 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 13:23:21,735 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:23:21,735 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 13:23:21,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states. [2018-11-18 13:23:21,794 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 474 [2018-11-18 13:23:21,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:21,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:21,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:23:21,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:21,801 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 13:23:21,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states. [2018-11-18 13:23:21,810 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 474 [2018-11-18 13:23:21,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:21,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:21,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 13:23:21,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:21,817 INFO L794 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 243#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 409#L116-3true [2018-11-18 13:23:21,818 INFO L796 eck$LassoCheckResult]: Loop: 409#L116-3true assume true; 416#L116-1true assume !!(add_history_type_~var~0 < 3); 366#L117true assume !(0 == add_history_type_~history_id); 226#L123true assume !(1 == add_history_type_~history_id); 479#L129true assume !(2 == add_history_type_~history_id); 192#L135true assume !(3 == add_history_type_~history_id); 191#L135-2true add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 409#L116-3true [2018-11-18 13:23:21,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 13:23:21,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:21,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:21,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:21,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:21,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:21,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:21,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1102018133, now seen corresponding path program 1 times [2018-11-18 13:23:21,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:21,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:21,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:21,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:21,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash 444278697, now seen corresponding path program 1 times [2018-11-18 13:23:21,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:21,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:21,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:21,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:21,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:22,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:22,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:22,061 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:22,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:22,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:22,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:22,062 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:23:22,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:22,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:22,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-18 13:23:22,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:22,063 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:22,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,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-18 13:23:22,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,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-18 13:23:22,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-18 13:23:22,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:22,315 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,339 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_1=3} Honda state: {v_rep#funAddr~voter.offset_1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,350 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,353 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,354 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,406 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,406 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,431 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,450 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,450 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,498 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,498 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/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-18 13:23:22,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,502 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,519 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,520 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,543 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,543 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,550 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_1=-1} Honda state: {v_rep#funAddr~voter.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,574 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,574 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,609 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:22,609 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:22,638 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:23:22,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:22,674 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:23:22,675 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:22,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:22,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:22,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:22,676 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:23:22,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:22,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:22,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:22,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-18 13:23:22,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:22,676 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:22,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:22,869 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:22,874 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:23:22,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:22,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:22,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:22,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:22,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:22,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:22,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:22,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,940 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:23:22,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,940 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:23:22,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:22,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:22,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-18 13:23:22,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:22,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:22,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:22,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:22,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:22,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:22,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:22,945 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:23:22,946 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:23:22,946 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:23:22,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:23:22,948 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:23:22,948 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:23:22,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-18 13:23:22,949 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:23:22,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:22,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:23,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:23,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:23:23,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 493 states. Second operand 4 states. [2018-11-18 13:23:23,150 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 493 states.. Second operand 4 states. Result 2052 states and 3382 transitions. Complement of second has 8 states. [2018-11-18 13:23:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:23:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:23:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1770 transitions. [2018-11-18 13:23:23,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1770 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-18 13:23:23,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:23,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1770 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-18 13:23:23,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:23,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1770 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-18 13:23:23,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:23,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2052 states and 3382 transitions. [2018-11-18 13:23:23,173 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 867 [2018-11-18 13:23:23,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2052 states to 991 states and 1636 transitions. [2018-11-18 13:23:23,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 937 [2018-11-18 13:23:23,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 938 [2018-11-18 13:23:23,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 991 states and 1636 transitions. [2018-11-18 13:23:23,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:23,189 INFO L705 BuchiCegarLoop]: Abstraction has 991 states and 1636 transitions. [2018-11-18 13:23:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states and 1636 transitions. [2018-11-18 13:23:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 763. [2018-11-18 13:23:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-18 13:23:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1269 transitions. [2018-11-18 13:23:23,237 INFO L728 BuchiCegarLoop]: Abstraction has 763 states and 1269 transitions. [2018-11-18 13:23:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:23,241 INFO L87 Difference]: Start difference. First operand 763 states and 1269 transitions. Second operand 3 states. [2018-11-18 13:23:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:23,307 INFO L93 Difference]: Finished difference Result 959 states and 1521 transitions. [2018-11-18 13:23:23,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:23,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 959 states and 1521 transitions. [2018-11-18 13:23:23,314 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 846 [2018-11-18 13:23:23,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 959 states to 905 states and 1467 transitions. [2018-11-18 13:23:23,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 888 [2018-11-18 13:23:23,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 888 [2018-11-18 13:23:23,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 905 states and 1467 transitions. [2018-11-18 13:23:23,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:23,320 INFO L705 BuchiCegarLoop]: Abstraction has 905 states and 1467 transitions. [2018-11-18 13:23:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states and 1467 transitions. [2018-11-18 13:23:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 444. [2018-11-18 13:23:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-18 13:23:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 727 transitions. [2018-11-18 13:23:23,330 INFO L728 BuchiCegarLoop]: Abstraction has 444 states and 727 transitions. [2018-11-18 13:23:23,330 INFO L608 BuchiCegarLoop]: Abstraction has 444 states and 727 transitions. [2018-11-18 13:23:23,330 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 13:23:23,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 444 states and 727 transitions. [2018-11-18 13:23:23,332 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 396 [2018-11-18 13:23:23,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:23,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:23,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:23,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:23,333 INFO L794 eck$LassoCheckResult]: Stem: 4703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 4651#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4652#L116-3 assume true; 4753#L116-1 assume !(add_history_type_~var~0 < 3); 4750#L116-4 add_history_type_#res := 1; 4697#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 4552#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4553#L116-8 [2018-11-18 13:23:23,333 INFO L796 eck$LassoCheckResult]: Loop: 4553#L116-8 assume true; 4756#L116-6 assume !!(add_history_type_~var~0 < 3); 4758#L117-2 assume !(0 == add_history_type_~history_id); 4644#L123-2 assume !(1 == add_history_type_~history_id); 4645#L129-2 assume !(2 == add_history_type_~history_id); 4619#L135-3 assume !(3 == add_history_type_~history_id); 4364#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 4553#L116-8 [2018-11-18 13:23:23,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1806157978, now seen corresponding path program 1 times [2018-11-18 13:23:23,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:23,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:23,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:23,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:23,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:23,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:23,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1633825204, now seen corresponding path program 1 times [2018-11-18 13:23:23,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:23,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:23,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:23,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:23,389 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:23,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:23,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:23,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:23,389 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:23:23,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,389 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:23,390 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:23,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-18 13:23:23,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:23,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:23,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,562 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:23,562 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,568 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:23,568 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:23,602 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_3=3} Honda state: {v_rep#funAddr~voter.offset_3=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,610 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:23,610 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,626 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,640 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:23,641 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,646 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,646 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:23,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:23,668 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,683 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,685 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:23,685 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_3=-1} Honda state: {v_rep#funAddr~voter.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:23,701 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,717 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:23:23,717 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:23,733 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:23:23,734 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:23,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:23,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:23,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:23,734 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:23:23,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:23,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:23,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:23,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-18 13:23:23,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:23,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:23,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-18 13:23:23,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,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-18 13:23:23,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:23,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:23,849 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:23:23,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:23,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:23,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:23,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:23,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:23,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:23,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:23,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:23,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:23,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:23,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:23,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:23,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:23,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:23,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:23,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:23,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:23,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:23,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:23,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:23,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:23,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:23,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:23,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:23,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23: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-18 13:23:23,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:23,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:23,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:23,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:23,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:23,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:23,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:23,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:23,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:23,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:23,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:23,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:23,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:23,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:23,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:23,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:23:23,868 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:23:23,868 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:23:23,869 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:23:23,869 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:23:23,869 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:23:23,869 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-18 13:23:23,869 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:23:23,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:23,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:23,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:23,908 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:23:23,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 444 states and 727 transitions. cyclomatic complexity: 291 Second operand 4 states. [2018-11-18 13:23:23,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 444 states and 727 transitions. cyclomatic complexity: 291. Second operand 4 states. Result 1637 states and 2652 transitions. Complement of second has 7 states. [2018-11-18 13:23:23,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:23:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:23:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1223 transitions. [2018-11-18 13:23:23,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1223 transitions. Stem has 7 letters. Loop has 7 letters. [2018-11-18 13:23:23,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:23,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1223 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-18 13:23:23,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:23,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1223 transitions. Stem has 7 letters. Loop has 14 letters. [2018-11-18 13:23:23,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:23,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1637 states and 2652 transitions. [2018-11-18 13:23:23,961 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1014 [2018-11-18 13:23:23,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1637 states to 1178 states and 1908 transitions. [2018-11-18 13:23:23,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1102 [2018-11-18 13:23:23,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1104 [2018-11-18 13:23:23,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1178 states and 1908 transitions. [2018-11-18 13:23:23,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:23,966 INFO L705 BuchiCegarLoop]: Abstraction has 1178 states and 1908 transitions. [2018-11-18 13:23:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states and 1908 transitions. [2018-11-18 13:23:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 498. [2018-11-18 13:23:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-11-18 13:23:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 813 transitions. [2018-11-18 13:23:23,974 INFO L728 BuchiCegarLoop]: Abstraction has 498 states and 813 transitions. [2018-11-18 13:23:23,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:23,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:23,975 INFO L87 Difference]: Start difference. First operand 498 states and 813 transitions. Second operand 3 states. [2018-11-18 13:23:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:24,005 INFO L93 Difference]: Finished difference Result 975 states and 1593 transitions. [2018-11-18 13:23:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:24,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 975 states and 1593 transitions. [2018-11-18 13:23:24,009 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 564 [2018-11-18 13:23:24,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 975 states to 975 states and 1593 transitions. [2018-11-18 13:23:24,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 832 [2018-11-18 13:23:24,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 832 [2018-11-18 13:23:24,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 975 states and 1593 transitions. [2018-11-18 13:23:24,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:24,013 INFO L705 BuchiCegarLoop]: Abstraction has 975 states and 1593 transitions. [2018-11-18 13:23:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states and 1593 transitions. [2018-11-18 13:23:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 504. [2018-11-18 13:23:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-18 13:23:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 819 transitions. [2018-11-18 13:23:24,019 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 819 transitions. [2018-11-18 13:23:24,019 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 819 transitions. [2018-11-18 13:23:24,019 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 13:23:24,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 819 transitions. [2018-11-18 13:23:24,021 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 339 [2018-11-18 13:23:24,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:24,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:24,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:24,022 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] [2018-11-18 13:23:24,023 INFO L794 eck$LassoCheckResult]: Stem: 8368#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 8310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 8311#L116-3 assume true; 8427#L116-1 assume !!(add_history_type_~var~0 < 3); 8406#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 8046#L171 assume 0 == read_history_bool_~history_id; 8047#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8053#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8182#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8360#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 8201#L255 assume 0 == init_~tmp~1;init_#res := 0; 8079#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 8081#L558-3 [2018-11-18 13:23:24,024 INFO L796 eck$LassoCheckResult]: Loop: 8081#L558-3 assume true; 8439#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8070#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8071#L236-2 assume { :end_inline_write_history_bool } true; 8179#L390 assume 0 != ~gate1Failed~0 % 256; 8064#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 8065#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 8082#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8043#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8044#L236-5 assume { :end_inline_write_history_bool } true; 8139#L421 assume 0 != ~gate2Failed~0 % 256; 8019#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 8009#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 8010#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8370#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8130#L236-8 assume { :end_inline_write_history_bool } true; 8173#L452 assume 0 != ~gate3Failed~0 % 256; 8210#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 8194#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 8195#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 8206#L486 assume ~VALUE1~0 == ~VALUE2~0; 8208#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 7959#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 8293#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 8292#L211-2 assume { :end_inline_write_history_int8 } true; 8286#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 8287#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 8284#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 8285#L171-12 assume 0 == read_history_bool_~history_id; 8401#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8113#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 8153#L307 assume !(0 == check_~tmp___3~0 % 256); 8257#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 8319#L151-7 assume 3 == read_history_int8_~history_id; 8334#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 8226#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 8190#L346 assume !(check_~tmp___10~0 > -2); 8174#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 8175#L151-9 assume 3 == read_history_int8_~history_id; 8329#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 8221#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 8277#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 8189#L366-1 check_#res := 1; 8020#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 8021#L583-72 assume !(0 == assert_~arg % 256); 8200#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 8081#L558-3 [2018-11-18 13:23:24,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1149248423, now seen corresponding path program 1 times [2018-11-18 13:23:24,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:24,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:24,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:24,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:23:24,058 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:24,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash 459134191, now seen corresponding path program 1 times [2018-11-18 13:23:24,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:24,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:24,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:24,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:24,085 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:24,085 INFO L87 Difference]: Start difference. First operand 504 states and 819 transitions. cyclomatic complexity: 323 Second operand 3 states. [2018-11-18 13:23:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:24,104 INFO L93 Difference]: Finished difference Result 505 states and 819 transitions. [2018-11-18 13:23:24,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:24,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 505 states and 819 transitions. [2018-11-18 13:23:24,107 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 339 [2018-11-18 13:23:24,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 505 states to 504 states and 815 transitions. [2018-11-18 13:23:24,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 430 [2018-11-18 13:23:24,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2018-11-18 13:23:24,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 815 transitions. [2018-11-18 13:23:24,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:24,109 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 815 transitions. [2018-11-18 13:23:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 815 transitions. [2018-11-18 13:23:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2018-11-18 13:23:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-18 13:23:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 815 transitions. [2018-11-18 13:23:24,115 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 815 transitions. [2018-11-18 13:23:24,115 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 815 transitions. [2018-11-18 13:23:24,115 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 13:23:24,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 815 transitions. [2018-11-18 13:23:24,116 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 339 [2018-11-18 13:23:24,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:24,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:24,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:24,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:24,117 INFO L794 eck$LassoCheckResult]: Stem: 9384#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 9326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9327#L116-3 assume true; 9443#L116-1 assume !!(add_history_type_~var~0 < 3); 9422#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 9062#L171 assume 0 == read_history_bool_~history_id; 9063#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 9069#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 9198#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 9376#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 9217#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9218#L116-8 assume true; 9447#L116-6 assume !!(add_history_type_~var~0 < 3); 9452#L117-2 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 9411#L171-3 assume 0 == read_history_bool_~history_id; 9414#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 9056#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 9163#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 9007#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 9093#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9094#L116-13 assume true; 9433#L116-11 assume !!(add_history_type_~var~0 < 3); 9434#L117-4 [2018-11-18 13:23:24,118 INFO L796 eck$LassoCheckResult]: Loop: 9434#L117-4 assume !(0 == add_history_type_~history_id); 9313#L123-4 assume !(1 == add_history_type_~history_id); 9314#L129-4 assume !(2 == add_history_type_~history_id); 9285#L135-6 assume !(3 == add_history_type_~history_id); 8998#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 9459#L116-13 assume true; 9458#L116-11 assume !!(add_history_type_~var~0 < 3); 9434#L117-4 [2018-11-18 13:23:24,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1206696970, now seen corresponding path program 1 times [2018-11-18 13:23:24,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:24,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:24,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:24,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:23:24,157 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:24,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:24,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1214143545, now seen corresponding path program 1 times [2018-11-18 13:23:24,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:24,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:24,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:24,181 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:24,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:24,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:24,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:24,182 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:23:24,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:24,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:24,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-18 13:23:24,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:24,182 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:24,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,305 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:24,305 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:24,310 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:23:24,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:24,376 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:23:24,377 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:24,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:24,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:24,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:24,377 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:23:24,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:24,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:24,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-18 13:23:24,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:24,378 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:24,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,527 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:24,527 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:23:24,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:24,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:24,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:24,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:24,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:24,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:24,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:24,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:24,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:24,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:24,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:24,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:24,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:24,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:24,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:24,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:24,532 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:23:24,533 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:23:24,533 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:23:24,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:23:24,533 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:23:24,533 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:23:24,533 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-18 13:23:24,533 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:23:24,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:24,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:24,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:24,594 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:23:24,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 504 states and 815 transitions. cyclomatic complexity: 319 Second operand 4 states. [2018-11-18 13:23:24,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 504 states and 815 transitions. cyclomatic complexity: 319. Second operand 4 states. Result 567 states and 919 transitions. Complement of second has 7 states. [2018-11-18 13:23:24,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:23:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:23:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2018-11-18 13:23:24,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 22 letters. Loop has 7 letters. [2018-11-18 13:23:24,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:24,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 29 letters. Loop has 7 letters. [2018-11-18 13:23:24,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:24,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 22 letters. Loop has 14 letters. [2018-11-18 13:23:24,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:24,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 919 transitions. [2018-11-18 13:23:24,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2018-11-18 13:23:24,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 562 states and 910 transitions. [2018-11-18 13:23:24,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 429 [2018-11-18 13:23:24,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2018-11-18 13:23:24,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 910 transitions. [2018-11-18 13:23:24,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:24,621 INFO L705 BuchiCegarLoop]: Abstraction has 562 states and 910 transitions. [2018-11-18 13:23:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 910 transitions. [2018-11-18 13:23:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 557. [2018-11-18 13:23:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-11-18 13:23:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 905 transitions. [2018-11-18 13:23:24,626 INFO L728 BuchiCegarLoop]: Abstraction has 557 states and 905 transitions. [2018-11-18 13:23:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:23:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:23:24,627 INFO L87 Difference]: Start difference. First operand 557 states and 905 transitions. Second operand 4 states. [2018-11-18 13:23:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:24,660 INFO L93 Difference]: Finished difference Result 791 states and 1276 transitions. [2018-11-18 13:23:24,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:23:24,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 791 states and 1276 transitions. [2018-11-18 13:23:24,664 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 507 [2018-11-18 13:23:24,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 791 states to 774 states and 1249 transitions. [2018-11-18 13:23:24,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 643 [2018-11-18 13:23:24,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 643 [2018-11-18 13:23:24,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 774 states and 1249 transitions. [2018-11-18 13:23:24,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:24,667 INFO L705 BuchiCegarLoop]: Abstraction has 774 states and 1249 transitions. [2018-11-18 13:23:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states and 1249 transitions. [2018-11-18 13:23:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 542. [2018-11-18 13:23:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-18 13:23:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 879 transitions. [2018-11-18 13:23:24,672 INFO L728 BuchiCegarLoop]: Abstraction has 542 states and 879 transitions. [2018-11-18 13:23:24,672 INFO L608 BuchiCegarLoop]: Abstraction has 542 states and 879 transitions. [2018-11-18 13:23:24,673 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 13:23:24,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 879 transitions. [2018-11-18 13:23:24,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2018-11-18 13:23:24,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:24,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:24,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-11-18 13:23:24,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:24,676 INFO L794 eck$LassoCheckResult]: Stem: 11946#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 11883#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11884#L116-3 assume true; 12011#L116-1 assume !!(add_history_type_~var~0 < 3); 11992#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11608#L171 assume 0 == read_history_bool_~history_id; 11609#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11612#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11750#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 11833#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 11834#L116-3 assume true; 12012#L116-1 assume !(add_history_type_~var~0 < 3); 12008#L116-4 add_history_type_#res := 1; 11942#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 11768#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11769#L116-8 assume true; 12015#L116-6 assume !!(add_history_type_~var~0 < 3); 12021#L117-2 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11980#L171-3 assume 0 == read_history_bool_~history_id; 11983#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11602#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11709#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11541#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 11633#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11634#L116-13 assume true; 12000#L116-11 assume !!(add_history_type_~var~0 < 3); 11971#L117-4 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11973#L171-6 assume 0 == read_history_bool_~history_id; 11969#L172-6 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11640#L203-6 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11680#L119-2 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11531#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 11881#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11882#L116-18 assume true; 12006#L116-16 assume !!(add_history_type_~var~0 < 3); 12007#L117-6 [2018-11-18 13:23:24,676 INFO L796 eck$LassoCheckResult]: Loop: 12007#L117-6 assume !(0 == add_history_type_~history_id); 11865#L123-6 assume !(1 == add_history_type_~history_id); 11866#L129-6 assume !(2 == add_history_type_~history_id); 11581#L135-9 assume !(3 == add_history_type_~history_id); 11521#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 12026#L116-18 assume true; 12024#L116-16 assume !!(add_history_type_~var~0 < 3); 12007#L117-6 [2018-11-18 13:23:24,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash 986945626, now seen corresponding path program 1 times [2018-11-18 13:23:24,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:24,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:24,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:24,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:24,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:23:24,722 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:24,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:24,723 INFO L82 PathProgramCache]: Analyzing trace with hash 682336474, now seen corresponding path program 1 times [2018-11-18 13:23:24,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:24,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:24,740 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:24,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:24,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:24,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:24,740 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:23:24,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:24,740 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:24,740 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-18 13:23:24,740 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:24,740 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:24,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:24,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:24,849 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:24,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:24,857 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:24,858 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_7=-1} Honda state: {v_rep#funAddr~voter.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:24,874 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:24,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:24,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_7=3} Honda state: {v_rep#funAddr~voter.offset_7=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:24,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:24,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:24,918 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:24,942 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:24,957 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:24,958 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:24,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:24,965 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:24,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:24,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:24,981 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:25,005 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:25,005 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:25,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:25,008 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:25,010 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:25,011 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:25,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:25,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:25,027 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:25,027 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:25,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:25,042 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:25,045 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:25,045 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:25,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:25,061 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:25,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:23:25,078 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:25,128 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:23:25,129 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:25,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:25,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:25,130 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:25,130 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:23:25,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:25,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:25,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:25,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-18 13:23:25,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:25,130 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:25,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,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-18 13:23:25,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,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-18 13:23:25,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,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-18 13:23:25,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:25,249 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:25,249 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:23:25,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:25,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:25,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:25,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:25,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:25,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:25,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:25,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:25,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,256 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 13:23:25,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,256 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 13:23:25,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:25,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:25,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:25,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:25,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:25,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:25,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:25,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:23:25,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:23:25,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:25,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:25,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:25,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:25,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:25,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:25,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:25,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:25,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:25,273 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:23:25,274 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:23:25,275 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:23:25,275 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:23:25,275 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:23:25,275 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:23:25,275 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-18 13:23:25,275 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:23:25,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:25,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:25,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:25,352 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 13:23:25,352 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 542 states and 879 transitions. cyclomatic complexity: 345 Second operand 4 states. [2018-11-18 13:23:25,388 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 542 states and 879 transitions. cyclomatic complexity: 345. Second operand 4 states. Result 1283 states and 2077 transitions. Complement of second has 6 states. [2018-11-18 13:23:25,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:23:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 13:23:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1049 transitions. [2018-11-18 13:23:25,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1049 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-18 13:23:25,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:25,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1049 transitions. Stem has 42 letters. Loop has 7 letters. [2018-11-18 13:23:25,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:25,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1049 transitions. Stem has 35 letters. Loop has 14 letters. [2018-11-18 13:23:25,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:25,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1283 states and 2077 transitions. [2018-11-18 13:23:25,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 450 [2018-11-18 13:23:25,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1283 states to 826 states and 1338 transitions. [2018-11-18 13:23:25,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2018-11-18 13:23:25,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 638 [2018-11-18 13:23:25,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 826 states and 1338 transitions. [2018-11-18 13:23:25,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:25,402 INFO L705 BuchiCegarLoop]: Abstraction has 826 states and 1338 transitions. [2018-11-18 13:23:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states and 1338 transitions. [2018-11-18 13:23:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 595. [2018-11-18 13:23:25,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-11-18 13:23:25,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 969 transitions. [2018-11-18 13:23:25,410 INFO L728 BuchiCegarLoop]: Abstraction has 595 states and 969 transitions. [2018-11-18 13:23:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:23:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:23:25,411 INFO L87 Difference]: Start difference. First operand 595 states and 969 transitions. Second operand 5 states. [2018-11-18 13:23:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:25,506 INFO L93 Difference]: Finished difference Result 735 states and 1177 transitions. [2018-11-18 13:23:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:23:25,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 735 states and 1177 transitions. [2018-11-18 13:23:25,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 450 [2018-11-18 13:23:25,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 735 states to 735 states and 1177 transitions. [2018-11-18 13:23:25,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 598 [2018-11-18 13:23:25,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 598 [2018-11-18 13:23:25,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 735 states and 1177 transitions. [2018-11-18 13:23:25,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:25,514 INFO L705 BuchiCegarLoop]: Abstraction has 735 states and 1177 transitions. [2018-11-18 13:23:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states and 1177 transitions. [2018-11-18 13:23:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 503. [2018-11-18 13:23:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-18 13:23:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 807 transitions. [2018-11-18 13:23:25,521 INFO L728 BuchiCegarLoop]: Abstraction has 503 states and 807 transitions. [2018-11-18 13:23:25,521 INFO L608 BuchiCegarLoop]: Abstraction has 503 states and 807 transitions. [2018-11-18 13:23:25,521 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 13:23:25,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 503 states and 807 transitions. [2018-11-18 13:23:25,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 225 [2018-11-18 13:23:25,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:25,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:25,524 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:25,524 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] [2018-11-18 13:23:25,525 INFO L794 eck$LassoCheckResult]: Stem: 15089#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 14829#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14830#L116-3 assume true; 15251#L116-1 assume !!(add_history_type_~var~0 < 3); 15210#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15034#L171 assume 0 == read_history_bool_~history_id; 15035#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14805#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 15008#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 15009#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 15252#L116-3 assume true; 15253#L116-1 assume !(add_history_type_~var~0 < 3); 15247#L116-4 add_history_type_#res := 1; 15060#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 15061#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15191#L116-8 assume true; 15271#L116-6 assume !!(add_history_type_~var~0 < 3); 15185#L117-2 assume !(0 == add_history_type_~history_id); 15186#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15254#L171-4 assume 0 == read_history_bool_~history_id; 15183#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14846#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14885#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14857#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 15054#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15055#L116-13 assume true; 15229#L116-11 assume !!(add_history_type_~var~0 < 3); 15175#L117-4 assume !(0 == add_history_type_~history_id); 15176#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15277#L171-7 assume 0 == read_history_bool_~history_id; 15169#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14935#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14878#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14851#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 14812#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14813#L116-18 assume true; 15240#L116-16 assume !!(add_history_type_~var~0 < 3); 15164#L117-6 assume !(0 == add_history_type_~history_id); 15165#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15268#L171-10 assume 0 == read_history_bool_~history_id; 15198#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14915#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14869#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14841#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 15090#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 15056#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 15057#L558-3 [2018-11-18 13:23:25,525 INFO L796 eck$LassoCheckResult]: Loop: 15057#L558-3 assume true; 15301#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15046#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15047#L236-2 assume { :end_inline_write_history_bool } true; 15153#L390 assume 0 != ~gate1Failed~0 % 256; 15042#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 15043#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 15058#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15031#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15032#L236-5 assume { :end_inline_write_history_bool } true; 15112#L421 assume 0 != ~gate2Failed~0 % 256; 14962#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 14910#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 14889#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15100#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15092#L236-8 assume { :end_inline_write_history_bool } true; 15140#L452 assume 0 != ~gate3Failed~0 % 256; 15203#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 15171#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 15172#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 15200#L486 assume ~VALUE1~0 == ~VALUE2~0; 15202#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 14822#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 15302#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 15245#L211-2 assume { :end_inline_write_history_int8 } true; 15296#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 15297#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 15084#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15259#L171-12 assume 0 == read_history_bool_~history_id; 15193#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14964#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 14837#L307 assume !(0 == check_~tmp___3~0 % 256); 14838#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 14849#L151-7 assume 3 == read_history_int8_~history_id; 14923#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14924#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 14930#L346 assume !(check_~tmp___10~0 > -2); 15141#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15142#L151-9 assume 3 == read_history_int8_~history_id; 14911#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14913#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 14918#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 14986#L366-1 check_#res := 1; 14976#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14977#L583-72 assume !(0 == assert_~arg % 256); 15189#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 15057#L558-3 [2018-11-18 13:23:25,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1672512711, now seen corresponding path program 1 times [2018-11-18 13:23:25,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:25,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:25,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:25,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:23:25,575 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:25,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash 459134191, now seen corresponding path program 2 times [2018-11-18 13:23:25,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:25,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:25,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:25,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:25,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:25,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:25,603 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:25,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:25,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:25,603 INFO L87 Difference]: Start difference. First operand 503 states and 807 transitions. cyclomatic complexity: 309 Second operand 3 states. [2018-11-18 13:23:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:25,649 INFO L93 Difference]: Finished difference Result 516 states and 823 transitions. [2018-11-18 13:23:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:25,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 516 states and 823 transitions. [2018-11-18 13:23:25,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 236 [2018-11-18 13:23:25,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 516 states to 516 states and 823 transitions. [2018-11-18 13:23:25,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 379 [2018-11-18 13:23:25,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 379 [2018-11-18 13:23:25,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 516 states and 823 transitions. [2018-11-18 13:23:25,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:25,654 INFO L705 BuchiCegarLoop]: Abstraction has 516 states and 823 transitions. [2018-11-18 13:23:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 823 transitions. [2018-11-18 13:23:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 503. [2018-11-18 13:23:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-18 13:23:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 805 transitions. [2018-11-18 13:23:25,660 INFO L728 BuchiCegarLoop]: Abstraction has 503 states and 805 transitions. [2018-11-18 13:23:25,660 INFO L608 BuchiCegarLoop]: Abstraction has 503 states and 805 transitions. [2018-11-18 13:23:25,660 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 13:23:25,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 503 states and 805 transitions. [2018-11-18 13:23:25,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 225 [2018-11-18 13:23:25,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:25,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:25,663 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:25,663 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] [2018-11-18 13:23:25,664 INFO L794 eck$LassoCheckResult]: Stem: 16117#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 15857#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15858#L116-3 assume true; 16278#L116-1 assume !!(add_history_type_~var~0 < 3); 16238#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16061#L171 assume 0 == read_history_bool_~history_id; 16062#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15833#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 16042#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 16043#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 16279#L116-3 assume true; 16280#L116-1 assume !(add_history_type_~var~0 < 3); 16274#L116-4 add_history_type_#res := 1; 16087#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 16088#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16219#L116-8 assume true; 16298#L116-6 assume !!(add_history_type_~var~0 < 3); 16213#L117-2 assume !(0 == add_history_type_~history_id); 16214#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16281#L171-4 assume 0 == read_history_bool_~history_id; 16211#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15874#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15911#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15885#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 16080#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16081#L116-13 assume true; 16257#L116-11 assume !!(add_history_type_~var~0 < 3); 16203#L117-4 assume !(0 == add_history_type_~history_id); 16204#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16304#L171-7 assume 0 == read_history_bool_~history_id; 16196#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15960#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15906#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15878#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 15840#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15841#L116-18 assume true; 16267#L116-16 assume !!(add_history_type_~var~0 < 3); 16192#L117-6 assume !(0 == add_history_type_~history_id); 16193#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16294#L171-10 assume 0 == read_history_bool_~history_id; 16226#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15939#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15897#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15866#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 16118#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 16083#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 16084#L558-3 [2018-11-18 13:23:25,664 INFO L796 eck$LassoCheckResult]: Loop: 16084#L558-3 assume true; 16328#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16075#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 16076#L236-2 assume { :end_inline_write_history_bool } true; 16181#L390 assume 0 != ~gate1Failed~0 % 256; 16069#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 16070#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 16085#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16059#L226-2 assume !(0 == write_history_bool_~history_id); 16060#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16092#L236-5 assume { :end_inline_write_history_bool } true; 16140#L421 assume 0 != ~gate2Failed~0 % 256; 15990#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 15942#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 15917#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16130#L226-4 assume !(0 == write_history_bool_~history_id); 16119#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16120#L236-8 assume { :end_inline_write_history_bool } true; 16168#L452 assume 0 != ~gate3Failed~0 % 256; 16231#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 16199#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 16200#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 16228#L486 assume ~VALUE1~0 == ~VALUE2~0; 16230#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 15856#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 16329#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 16272#L211-2 assume { :end_inline_write_history_int8 } true; 16323#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 16324#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 16112#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16286#L171-12 assume 0 == read_history_bool_~history_id; 16221#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15992#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 15870#L307 assume !(0 == check_~tmp___3~0 % 256); 15871#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15882#L151-7 assume 3 == read_history_int8_~history_id; 15955#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15956#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 15958#L346 assume !(check_~tmp___10~0 > -2); 16169#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 16170#L151-9 assume 3 == read_history_int8_~history_id; 15943#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15945#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 15946#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 16014#L366-1 check_#res := 1; 16004#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 16005#L583-72 assume !(0 == assert_~arg % 256); 16217#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 16084#L558-3 [2018-11-18 13:23:25,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1672512711, now seen corresponding path program 2 times [2018-11-18 13:23:25,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:25,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:25,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:25,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:25,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:25,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:23:25,716 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:25,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:25,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1434876098, now seen corresponding path program 1 times [2018-11-18 13:23:25,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:25,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:25,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:25,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:25,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:25,731 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:25,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:23:25,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:23:25,731 INFO L87 Difference]: Start difference. First operand 503 states and 805 transitions. cyclomatic complexity: 307 Second operand 5 states. [2018-11-18 13:23:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:25,943 INFO L93 Difference]: Finished difference Result 1056 states and 1601 transitions. [2018-11-18 13:23:25,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:23:25,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1056 states and 1601 transitions. [2018-11-18 13:23:25,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 680 [2018-11-18 13:23:25,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1056 states to 1056 states and 1601 transitions. [2018-11-18 13:23:25,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 883 [2018-11-18 13:23:25,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 883 [2018-11-18 13:23:25,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1056 states and 1601 transitions. [2018-11-18 13:23:25,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:25,956 INFO L705 BuchiCegarLoop]: Abstraction has 1056 states and 1601 transitions. [2018-11-18 13:23:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states and 1601 transitions. [2018-11-18 13:23:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 471. [2018-11-18 13:23:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-18 13:23:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 725 transitions. [2018-11-18 13:23:25,969 INFO L728 BuchiCegarLoop]: Abstraction has 471 states and 725 transitions. [2018-11-18 13:23:25,969 INFO L608 BuchiCegarLoop]: Abstraction has 471 states and 725 transitions. [2018-11-18 13:23:25,969 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 13:23:25,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 471 states and 725 transitions. [2018-11-18 13:23:25,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 217 [2018-11-18 13:23:25,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:25,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:25,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:25,972 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] [2018-11-18 13:23:25,972 INFO L794 eck$LassoCheckResult]: Stem: 17690#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 17434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17435#L116-3 assume true; 17823#L116-1 assume !!(add_history_type_~var~0 < 3); 17786#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17634#L171 assume 0 == read_history_bool_~history_id; 17635#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17410#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 17615#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 17616#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 17824#L116-3 assume true; 17825#L116-1 assume !(add_history_type_~var~0 < 3); 17819#L116-4 add_history_type_#res := 1; 17660#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 17661#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17773#L116-8 assume true; 17843#L116-6 assume !!(add_history_type_~var~0 < 3); 17768#L117-2 assume !(0 == add_history_type_~history_id); 17769#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17826#L171-4 assume !(0 == read_history_bool_~history_id); 17705#L181-4 assume 1 == read_history_bool_~history_id; 17706#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17587#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17480#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17454#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 17653#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17654#L116-13 assume true; 17803#L116-11 assume !!(add_history_type_~var~0 < 3); 17762#L117-4 assume !(0 == add_history_type_~history_id); 17763#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17849#L171-7 assume !(0 == read_history_bool_~history_id); 17734#L181-7 assume 1 == read_history_bool_~history_id; 17735#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17529#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17475#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17447#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 17417#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17418#L116-18 assume true; 17812#L116-16 assume !!(add_history_type_~var~0 < 3); 17753#L117-6 assume !(0 == add_history_type_~history_id); 17754#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17839#L171-10 assume !(0 == read_history_bool_~history_id); 17722#L181-10 assume 1 == read_history_bool_~history_id; 17723#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17508#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17466#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17439#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 17691#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 17656#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 17657#L558-3 [2018-11-18 13:23:25,973 INFO L796 eck$LassoCheckResult]: Loop: 17657#L558-3 assume true; 17873#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17648#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 17649#L236-2 assume { :end_inline_write_history_bool } true; 17746#L390 assume 0 != ~gate1Failed~0 % 256; 17642#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 17643#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 17658#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17632#L226-2 assume !(0 == write_history_bool_~history_id); 17633#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17665#L236-5 assume { :end_inline_write_history_bool } true; 17713#L421 assume 0 != ~gate2Failed~0 % 256; 17561#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 17511#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 17486#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17703#L226-4 assume !(0 == write_history_bool_~history_id); 17692#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17693#L236-8 assume { :end_inline_write_history_bool } true; 17740#L452 assume 0 != ~gate3Failed~0 % 256; 17781#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17758#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 17759#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 17778#L486 assume ~VALUE1~0 == ~VALUE2~0; 17780#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 17433#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 17874#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17817#L211-2 assume { :end_inline_write_history_int8 } true; 17868#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 17869#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 17685#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17831#L171-12 assume 0 == read_history_bool_~history_id; 17775#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17563#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 17443#L307 assume !(0 == check_~tmp___3~0 % 256); 17444#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17451#L151-7 assume 3 == read_history_int8_~history_id; 17524#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17525#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 17527#L346 assume !(check_~tmp___10~0 > -2); 17741#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17742#L151-9 assume 3 == read_history_int8_~history_id; 17512#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17514#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 17515#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 17585#L366-1 check_#res := 1; 17575#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17576#L583-72 assume !(0 == assert_~arg % 256); 17772#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 17657#L558-3 [2018-11-18 13:23:25,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 1 times [2018-11-18 13:23:25,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:25,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:25,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:26,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:23:26,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:26,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1434876098, now seen corresponding path program 2 times [2018-11-18 13:23:26,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:26,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,052 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:26,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:26,052 INFO L87 Difference]: Start difference. First operand 471 states and 725 transitions. cyclomatic complexity: 259 Second operand 3 states. [2018-11-18 13:23:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:26,086 INFO L93 Difference]: Finished difference Result 495 states and 758 transitions. [2018-11-18 13:23:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:26,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 758 transitions. [2018-11-18 13:23:26,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 239 [2018-11-18 13:23:26,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 495 states and 758 transitions. [2018-11-18 13:23:26,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2018-11-18 13:23:26,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2018-11-18 13:23:26,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 758 transitions. [2018-11-18 13:23:26,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:26,092 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 758 transitions. [2018-11-18 13:23:26,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 758 transitions. [2018-11-18 13:23:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 471. [2018-11-18 13:23:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-18 13:23:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 724 transitions. [2018-11-18 13:23:26,099 INFO L728 BuchiCegarLoop]: Abstraction has 471 states and 724 transitions. [2018-11-18 13:23:26,099 INFO L608 BuchiCegarLoop]: Abstraction has 471 states and 724 transitions. [2018-11-18 13:23:26,099 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 13:23:26,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 471 states and 724 transitions. [2018-11-18 13:23:26,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 217 [2018-11-18 13:23:26,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:26,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:26,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:26,102 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] [2018-11-18 13:23:26,103 INFO L794 eck$LassoCheckResult]: Stem: 18664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 18408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18409#L116-3 assume true; 18797#L116-1 assume !!(add_history_type_~var~0 < 3); 18760#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18608#L171 assume 0 == read_history_bool_~history_id; 18609#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18381#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 18583#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 18584#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 18798#L116-3 assume true; 18799#L116-1 assume !(add_history_type_~var~0 < 3); 18792#L116-4 add_history_type_#res := 1; 18633#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 18634#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18747#L116-8 assume true; 18817#L116-6 assume !!(add_history_type_~var~0 < 3); 18742#L117-2 assume !(0 == add_history_type_~history_id); 18743#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18800#L171-4 assume !(0 == read_history_bool_~history_id); 18679#L181-4 assume 1 == read_history_bool_~history_id; 18680#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18561#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18454#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18428#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 18627#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18628#L116-13 assume true; 18777#L116-11 assume !!(add_history_type_~var~0 < 3); 18736#L117-4 assume !(0 == add_history_type_~history_id); 18737#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18823#L171-7 assume !(0 == read_history_bool_~history_id); 18708#L181-7 assume 1 == read_history_bool_~history_id; 18709#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18503#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18449#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18421#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 18391#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18392#L116-18 assume true; 18786#L116-16 assume !!(add_history_type_~var~0 < 3); 18727#L117-6 assume !(0 == add_history_type_~history_id); 18728#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18813#L171-10 assume !(0 == read_history_bool_~history_id); 18696#L181-10 assume 1 == read_history_bool_~history_id; 18697#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18482#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18440#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18413#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 18665#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 18630#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 18631#L558-3 [2018-11-18 13:23:26,103 INFO L796 eck$LassoCheckResult]: Loop: 18631#L558-3 assume true; 18847#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18622#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 18623#L236-2 assume { :end_inline_write_history_bool } true; 18720#L390 assume 0 != ~gate1Failed~0 % 256; 18616#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 18617#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 18632#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18606#L226-2 assume !(0 == write_history_bool_~history_id); 18607#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 18639#L236-5 assume { :end_inline_write_history_bool } true; 18687#L421 assume 0 != ~gate2Failed~0 % 256; 18535#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 18485#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 18460#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18676#L226-4 assume !(0 == write_history_bool_~history_id); 18666#L231-4 assume !(1 == write_history_bool_~history_id); 18667#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 18677#L236-8 assume { :end_inline_write_history_bool } true; 18714#L452 assume 0 != ~gate3Failed~0 % 256; 18755#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 18732#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 18733#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 18752#L486 assume ~VALUE1~0 == ~VALUE2~0; 18754#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 18407#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 18848#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 18791#L211-2 assume { :end_inline_write_history_int8 } true; 18842#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 18843#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 18659#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18805#L171-12 assume 0 == read_history_bool_~history_id; 18749#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18537#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 18417#L307 assume !(0 == check_~tmp___3~0 % 256); 18418#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18425#L151-7 assume 3 == read_history_int8_~history_id; 18498#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18499#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 18501#L346 assume !(check_~tmp___10~0 > -2); 18715#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18716#L151-9 assume 3 == read_history_int8_~history_id; 18486#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18488#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 18489#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 18559#L366-1 check_#res := 1; 18549#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 18550#L583-72 assume !(0 == assert_~arg % 256); 18746#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 18631#L558-3 [2018-11-18 13:23:26,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 2 times [2018-11-18 13:23:26,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:26,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:23:26,146 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:26,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1045201859, now seen corresponding path program 1 times [2018-11-18 13:23:26,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:26,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,183 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:26,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:26,184 INFO L87 Difference]: Start difference. First operand 471 states and 724 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-11-18 13:23:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:26,210 INFO L93 Difference]: Finished difference Result 671 states and 1036 transitions. [2018-11-18 13:23:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:26,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 671 states and 1036 transitions. [2018-11-18 13:23:26,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 417 [2018-11-18 13:23:26,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 671 states to 671 states and 1036 transitions. [2018-11-18 13:23:26,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2018-11-18 13:23:26,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2018-11-18 13:23:26,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 671 states and 1036 transitions. [2018-11-18 13:23:26,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:26,217 INFO L705 BuchiCegarLoop]: Abstraction has 671 states and 1036 transitions. [2018-11-18 13:23:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states and 1036 transitions. [2018-11-18 13:23:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 522. [2018-11-18 13:23:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-11-18 13:23:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 798 transitions. [2018-11-18 13:23:26,224 INFO L728 BuchiCegarLoop]: Abstraction has 522 states and 798 transitions. [2018-11-18 13:23:26,224 INFO L608 BuchiCegarLoop]: Abstraction has 522 states and 798 transitions. [2018-11-18 13:23:26,224 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 13:23:26,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 798 transitions. [2018-11-18 13:23:26,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 268 [2018-11-18 13:23:26,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:26,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:26,227 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:26,227 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] [2018-11-18 13:23:26,227 INFO L794 eck$LassoCheckResult]: Stem: 19814#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 19558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19559#L116-3 assume true; 19952#L116-1 assume !!(add_history_type_~var~0 < 3); 19912#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19758#L171 assume 0 == read_history_bool_~history_id; 19759#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 19531#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 19733#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 19734#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 19953#L116-3 assume true; 19954#L116-1 assume !(add_history_type_~var~0 < 3); 19947#L116-4 add_history_type_#res := 1; 19784#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 19785#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19898#L116-8 assume true; 19974#L116-6 assume !!(add_history_type_~var~0 < 3); 19893#L117-2 assume !(0 == add_history_type_~history_id); 19894#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19955#L171-4 assume !(0 == read_history_bool_~history_id); 19829#L181-4 assume 1 == read_history_bool_~history_id; 19830#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19711#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19604#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19578#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 19777#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19778#L116-13 assume true; 19929#L116-11 assume !!(add_history_type_~var~0 < 3); 19887#L117-4 assume !(0 == add_history_type_~history_id); 19888#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19982#L171-7 assume !(0 == read_history_bool_~history_id); 19858#L181-7 assume 1 == read_history_bool_~history_id; 19859#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19656#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19599#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19571#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 19541#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19542#L116-18 assume true; 19942#L116-16 assume !!(add_history_type_~var~0 < 3); 19877#L117-6 assume !(0 == add_history_type_~history_id); 19878#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19970#L171-10 assume !(0 == read_history_bool_~history_id); 19846#L181-10 assume 1 == read_history_bool_~history_id; 19847#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 19632#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19590#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19563#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 19815#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 19780#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 19781#L558-3 [2018-11-18 13:23:26,227 INFO L796 eck$LassoCheckResult]: Loop: 19781#L558-3 assume true; 20009#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 19772#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 19773#L236-2 assume { :end_inline_write_history_bool } true; 19870#L390 assume 0 != ~gate1Failed~0 % 256; 19766#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 19767#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 19782#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 19881#L226-2 assume !(0 == write_history_bool_~history_id); 20044#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 20041#L236-5 assume { :end_inline_write_history_bool } true; 20039#L421 assume 0 != ~gate2Failed~0 % 256; 20038#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 20037#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 20035#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 20034#L226-4 assume !(0 == write_history_bool_~history_id); 20033#L231-4 assume !(1 == write_history_bool_~history_id); 20030#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 20029#L236-8 assume { :end_inline_write_history_bool } true; 20028#L452 assume 0 != ~gate3Failed~0 % 256; 20027#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 20026#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 20025#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 20024#L486 assume ~VALUE1~0 == ~VALUE2~0; 20005#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 19557#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 20019#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 20010#L211-2 assume { :end_inline_write_history_int8 } true; 20003#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 20004#L294 assume !(0 == ~gate1Failed~0 % 256); 19808#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 19809#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19962#L171-12 assume 0 == read_history_bool_~history_id; 19900#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 19687#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 19567#L307 assume !(0 == check_~tmp___3~0 % 256); 19568#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 19575#L151-7 assume 3 == read_history_int8_~history_id; 19648#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19649#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 19651#L346 assume !(check_~tmp___10~0 > -2); 19865#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 19866#L151-9 assume 3 == read_history_int8_~history_id; 19636#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 19638#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 19639#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 19708#L366-1 check_#res := 1; 19699#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 19700#L583-72 assume !(0 == assert_~arg % 256); 19897#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 19781#L558-3 [2018-11-18 13:23:26,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 3 times [2018-11-18 13:23:26,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:26,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:23:26,282 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:26,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash -659680464, now seen corresponding path program 1 times [2018-11-18 13:23:26,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:26,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,318 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:23:26,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:23:26,318 INFO L87 Difference]: Start difference. First operand 522 states and 798 transitions. cyclomatic complexity: 281 Second operand 4 states. [2018-11-18 13:23:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:26,368 INFO L93 Difference]: Finished difference Result 797 states and 1218 transitions. [2018-11-18 13:23:26,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:23:26,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 797 states and 1218 transitions. [2018-11-18 13:23:26,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 536 [2018-11-18 13:23:26,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 797 states to 761 states and 1164 transitions. [2018-11-18 13:23:26,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2018-11-18 13:23:26,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 636 [2018-11-18 13:23:26,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 761 states and 1164 transitions. [2018-11-18 13:23:26,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:26,379 INFO L705 BuchiCegarLoop]: Abstraction has 761 states and 1164 transitions. [2018-11-18 13:23:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states and 1164 transitions. [2018-11-18 13:23:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 488. [2018-11-18 13:23:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-18 13:23:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 745 transitions. [2018-11-18 13:23:26,385 INFO L728 BuchiCegarLoop]: Abstraction has 488 states and 745 transitions. [2018-11-18 13:23:26,386 INFO L608 BuchiCegarLoop]: Abstraction has 488 states and 745 transitions. [2018-11-18 13:23:26,386 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 13:23:26,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 488 states and 745 transitions. [2018-11-18 13:23:26,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 268 [2018-11-18 13:23:26,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:26,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:26,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-11-18 13:23:26,388 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] [2018-11-18 13:23:26,388 INFO L794 eck$LassoCheckResult]: Stem: 21122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 20887#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20888#L116-3 assume true; 21249#L116-1 assume !!(add_history_type_~var~0 < 3); 21211#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21070#L171 assume 0 == read_history_bool_~history_id; 21071#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 20863#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 21049#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 21050#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21250#L116-3 assume true; 21251#L116-1 assume !(add_history_type_~var~0 < 3); 21245#L116-4 add_history_type_#res := 1; 21093#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 21094#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21198#L116-8 assume true; 21268#L116-6 assume !!(add_history_type_~var~0 < 3); 21195#L117-2 assume !(0 == add_history_type_~history_id); 21196#L123-2 assume !(1 == add_history_type_~history_id); 21293#L129-2 assume !(2 == add_history_type_~history_id); 21281#L135-3 assume !(3 == add_history_type_~history_id); 20907#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21269#L116-8 assume true; 21270#L116-6 assume !(add_history_type_~var~0 < 3); 21264#L116-9 add_history_type_#res := 1; 21126#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 21086#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21087#L116-13 assume true; 21235#L116-11 assume !!(add_history_type_~var~0 < 3); 21189#L117-4 assume !(0 == add_history_type_~history_id); 21190#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21274#L171-7 assume !(0 == read_history_bool_~history_id); 21161#L181-7 assume 1 == read_history_bool_~history_id; 21162#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 20976#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20920#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 20901#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 20870#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20871#L116-18 assume true; 21239#L116-16 assume !!(add_history_type_~var~0 < 3); 21180#L117-6 assume !(0 == add_history_type_~history_id); 21181#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21265#L171-10 assume !(0 == read_history_bool_~history_id); 21149#L181-10 assume 1 == read_history_bool_~history_id; 21150#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 20955#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20914#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 20895#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 21123#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 21089#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 21090#L558-3 [2018-11-18 13:23:26,388 INFO L796 eck$LassoCheckResult]: Loop: 21090#L558-3 assume true; 21294#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21082#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 21083#L236-2 assume { :end_inline_write_history_bool } true; 21173#L390 assume 0 != ~gate1Failed~0 % 256; 21077#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 21078#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 21091#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21068#L226-2 assume !(0 == write_history_bool_~history_id); 21069#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 21099#L236-5 assume { :end_inline_write_history_bool } true; 21140#L421 assume 0 != ~gate2Failed~0 % 256; 21008#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 20958#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 20930#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21132#L226-4 assume !(0 == write_history_bool_~history_id); 21124#L231-4 assume !(1 == write_history_bool_~history_id); 21125#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 21133#L236-8 assume { :end_inline_write_history_bool } true; 21167#L452 assume 0 != ~gate3Failed~0 % 256; 21208#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 21185#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 21186#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 21203#L486 assume ~VALUE1~0 == ~VALUE2~0; 21205#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 20880#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 21295#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 21243#L211-2 assume { :end_inline_write_history_int8 } true; 21290#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 21291#L294 assume !(0 == ~gate1Failed~0 % 256); 21116#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 21117#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21257#L171-12 assume 0 == read_history_bool_~history_id; 21200#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21004#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 20891#L307 assume !(0 == check_~tmp___3~0 % 256); 20892#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 20899#L151-7 assume 3 == read_history_int8_~history_id; 20964#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 20965#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 20971#L346 assume !(check_~tmp___10~0 > -2); 21168#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 21169#L151-9 assume 3 == read_history_int8_~history_id; 20951#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 20953#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 20959#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 21027#L366-1 check_#res := 1; 21017#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 21018#L583-72 assume !(0 == assert_~arg % 256); 21197#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 21090#L558-3 [2018-11-18 13:23:26,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1805174397, now seen corresponding path program 1 times [2018-11-18 13:23:26,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:26,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:26,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,435 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:26,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash -659680464, now seen corresponding path program 2 times [2018-11-18 13:23:26,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:26,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,455 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:26,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:26,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:26,455 INFO L87 Difference]: Start difference. First operand 488 states and 745 transitions. cyclomatic complexity: 262 Second operand 3 states. [2018-11-18 13:23:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:26,470 INFO L93 Difference]: Finished difference Result 725 states and 1112 transitions. [2018-11-18 13:23:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:26,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 725 states and 1112 transitions. [2018-11-18 13:23:26,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 505 [2018-11-18 13:23:26,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 725 states to 725 states and 1112 transitions. [2018-11-18 13:23:26,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 600 [2018-11-18 13:23:26,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 600 [2018-11-18 13:23:26,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 725 states and 1112 transitions. [2018-11-18 13:23:26,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:26,478 INFO L705 BuchiCegarLoop]: Abstraction has 725 states and 1112 transitions. [2018-11-18 13:23:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states and 1112 transitions. [2018-11-18 13:23:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 559. [2018-11-18 13:23:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-11-18 13:23:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 849 transitions. [2018-11-18 13:23:26,484 INFO L728 BuchiCegarLoop]: Abstraction has 559 states and 849 transitions. [2018-11-18 13:23:26,484 INFO L608 BuchiCegarLoop]: Abstraction has 559 states and 849 transitions. [2018-11-18 13:23:26,485 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 13:23:26,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 559 states and 849 transitions. [2018-11-18 13:23:26,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-18 13:23:26,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:26,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:26,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-11-18 13:23:26,487 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] [2018-11-18 13:23:26,487 INFO L794 eck$LassoCheckResult]: Stem: 22342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 22107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22108#L116-3 assume true; 22472#L116-1 assume !!(add_history_type_~var~0 < 3); 22432#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22291#L171 assume 0 == read_history_bool_~history_id; 22292#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22083#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 22270#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 22271#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22473#L116-3 assume true; 22474#L116-1 assume !(add_history_type_~var~0 < 3); 22469#L116-4 add_history_type_#res := 1; 22314#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 22315#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22418#L116-8 assume true; 22491#L116-6 assume !!(add_history_type_~var~0 < 3); 22415#L117-2 assume !(0 == add_history_type_~history_id); 22416#L123-2 assume !(1 == add_history_type_~history_id); 22520#L129-2 assume !(2 == add_history_type_~history_id); 22506#L135-3 assume !(3 == add_history_type_~history_id); 22127#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22492#L116-8 assume true; 22493#L116-6 assume !(add_history_type_~var~0 < 3); 22487#L116-9 add_history_type_#res := 1; 22346#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 22308#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22309#L116-13 assume true; 22458#L116-11 assume !!(add_history_type_~var~0 < 3); 22409#L117-4 assume !(0 == add_history_type_~history_id); 22410#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22498#L171-7 assume !(0 == read_history_bool_~history_id); 22381#L181-7 assume 1 == read_history_bool_~history_id; 22382#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22197#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22140#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22121#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 22090#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22091#L116-18 assume true; 22464#L116-16 assume !!(add_history_type_~var~0 < 3); 22400#L117-6 assume !(0 == add_history_type_~history_id); 22401#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22488#L171-10 assume !(0 == read_history_bool_~history_id); 22369#L181-10 assume 1 == read_history_bool_~history_id; 22370#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22172#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22131#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22112#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 22343#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 22310#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 22311#L558-3 [2018-11-18 13:23:26,487 INFO L796 eck$LassoCheckResult]: Loop: 22311#L558-3 assume true; 22521#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22301#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 22302#L236-2 assume { :end_inline_write_history_bool } true; 22393#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 22358#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 22297#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 22307#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 22470#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 22478#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22594#L226-2 assume !(0 == write_history_bool_~history_id); 22592#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 22589#L236-5 assume { :end_inline_write_history_bool } true; 22587#L421 assume 0 != ~gate2Failed~0 % 256; 22586#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 22585#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 22584#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22583#L226-4 assume !(0 == write_history_bool_~history_id); 22582#L231-4 assume !(1 == write_history_bool_~history_id); 22579#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 22576#L236-8 assume { :end_inline_write_history_bool } true; 22573#L452 assume 0 != ~gate3Failed~0 % 256; 22571#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 22570#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 22568#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 22565#L486 assume ~VALUE1~0 == ~VALUE2~0; 22563#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 22544#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 22539#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 22532#L211-2 assume { :end_inline_write_history_int8 } true; 22529#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 22526#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 22515#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22480#L171-12 assume 0 == read_history_bool_~history_id; 22420#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22226#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 22116#L307 assume !(0 == check_~tmp___3~0 % 256); 22117#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22119#L151-7 assume 3 == read_history_int8_~history_id; 22185#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22186#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 22192#L346 assume !(check_~tmp___10~0 > -2); 22388#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22389#L151-9 assume 3 == read_history_int8_~history_id; 22177#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22179#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 22180#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 22248#L366-1 check_#res := 1; 22238#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 22239#L583-72 assume !(0 == assert_~arg % 256); 22417#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 22311#L558-3 [2018-11-18 13:23:26,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1805174397, now seen corresponding path program 2 times [2018-11-18 13:23:26,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:23:26,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,527 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:26,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1276375210, now seen corresponding path program 1 times [2018-11-18 13:23:26,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:26,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,556 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:26,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:26,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:26,556 INFO L87 Difference]: Start difference. First operand 559 states and 849 transitions. cyclomatic complexity: 295 Second operand 3 states. [2018-11-18 13:23:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:26,591 INFO L93 Difference]: Finished difference Result 903 states and 1362 transitions. [2018-11-18 13:23:26,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:26,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 903 states and 1362 transitions. [2018-11-18 13:23:26,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 678 [2018-11-18 13:23:26,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 903 states to 903 states and 1362 transitions. [2018-11-18 13:23:26,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 788 [2018-11-18 13:23:26,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 788 [2018-11-18 13:23:26,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 903 states and 1362 transitions. [2018-11-18 13:23:26,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:26,598 INFO L705 BuchiCegarLoop]: Abstraction has 903 states and 1362 transitions. [2018-11-18 13:23:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states and 1362 transitions. [2018-11-18 13:23:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 551. [2018-11-18 13:23:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-11-18 13:23:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 831 transitions. [2018-11-18 13:23:26,605 INFO L728 BuchiCegarLoop]: Abstraction has 551 states and 831 transitions. [2018-11-18 13:23:26,605 INFO L608 BuchiCegarLoop]: Abstraction has 551 states and 831 transitions. [2018-11-18 13:23:26,605 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 13:23:26,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 831 transitions. [2018-11-18 13:23:26,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-18 13:23:26,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:26,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:26,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1] [2018-11-18 13:23:26,607 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] [2018-11-18 13:23:26,607 INFO L794 eck$LassoCheckResult]: Stem: 23800#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 23576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23577#L116-3 assume true; 23926#L116-1 assume !!(add_history_type_~var~0 < 3); 23890#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23752#L171 assume 0 == read_history_bool_~history_id; 23753#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 23549#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 23735#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 23736#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 23927#L116-3 assume true; 23928#L116-1 assume !(add_history_type_~var~0 < 3); 23923#L116-4 add_history_type_#res := 1; 23772#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 23773#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23877#L116-8 assume true; 23945#L116-6 assume !!(add_history_type_~var~0 < 3); 23874#L117-2 assume !(0 == add_history_type_~history_id); 23875#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23929#L171-4 assume !(0 == read_history_bool_~history_id); 23810#L181-4 assume 1 == read_history_bool_~history_id; 23811#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23715#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23611#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 23612#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 23946#L116-8 assume true; 23947#L116-6 assume !(add_history_type_~var~0 < 3); 23941#L116-9 add_history_type_#res := 1; 23804#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 23766#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23767#L116-13 assume true; 23980#L116-11 assume !!(add_history_type_~var~0 < 3); 23866#L117-4 assume !(0 == add_history_type_~history_id); 23867#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23951#L171-7 assume !(0 == read_history_bool_~history_id); 23836#L181-7 assume 1 == read_history_bool_~history_id; 23837#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23661#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23605#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23589#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 23559#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23560#L116-18 assume true; 23979#L116-16 assume !!(add_history_type_~var~0 < 3); 23855#L117-6 assume !(0 == add_history_type_~history_id); 23856#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23942#L171-10 assume !(0 == read_history_bool_~history_id); 23824#L181-10 assume 1 == read_history_bool_~history_id; 23825#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23639#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23598#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23581#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 23801#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 23769#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 23770#L558-3 [2018-11-18 13:23:26,608 INFO L796 eck$LassoCheckResult]: Loop: 23770#L558-3 assume true; 23970#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23763#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 23764#L236-2 assume { :end_inline_write_history_bool } true; 23848#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 23813#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 23758#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 23768#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 23925#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 23932#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 24064#L226-2 assume !(0 == write_history_bool_~history_id); 24062#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 24059#L236-5 assume { :end_inline_write_history_bool } true; 24058#L421 assume 0 != ~gate2Failed~0 % 256; 23689#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 23642#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 23643#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23807#L226-4 assume !(0 == write_history_bool_~history_id); 23802#L231-4 assume !(1 == write_history_bool_~history_id); 23803#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 23808#L236-8 assume { :end_inline_write_history_bool } true; 23842#L452 assume 0 != ~gate3Failed~0 % 256; 23885#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 23862#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 23863#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 23882#L486 assume ~VALUE1~0 == ~VALUE2~0; 23884#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 23575#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 23972#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 23922#L211-2 assume { :end_inline_write_history_int8 } true; 23971#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 23981#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 23965#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23934#L171-12 assume 0 == read_history_bool_~history_id; 23879#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 23691#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 23585#L307 assume !(0 == check_~tmp___3~0 % 256); 23586#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 23593#L151-7 assume 3 == read_history_int8_~history_id; 23656#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23657#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 23659#L346 assume !(check_~tmp___10~0 > -2); 23843#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 23844#L151-9 assume 3 == read_history_int8_~history_id; 23644#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23646#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 23647#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 23713#L366-1 check_#res := 1; 23703#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 23704#L583-72 assume !(0 == assert_~arg % 256); 23876#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 23770#L558-3 [2018-11-18 13:23:26,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 1 times [2018-11-18 13:23:26,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:26,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:23:26,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,637 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:26,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1276375210, now seen corresponding path program 2 times [2018-11-18 13:23:26,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:26,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,652 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:26,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:26,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:26,653 INFO L87 Difference]: Start difference. First operand 551 states and 831 transitions. cyclomatic complexity: 287 Second operand 3 states. [2018-11-18 13:23:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:26,754 INFO L93 Difference]: Finished difference Result 861 states and 1241 transitions. [2018-11-18 13:23:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:26,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 1241 transitions. [2018-11-18 13:23:26,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-18 13:23:26,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 861 states and 1241 transitions. [2018-11-18 13:23:26,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2018-11-18 13:23:26,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 687 [2018-11-18 13:23:26,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1241 transitions. [2018-11-18 13:23:26,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:26,763 INFO L705 BuchiCegarLoop]: Abstraction has 861 states and 1241 transitions. [2018-11-18 13:23:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1241 transitions. [2018-11-18 13:23:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 551. [2018-11-18 13:23:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-11-18 13:23:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 803 transitions. [2018-11-18 13:23:26,770 INFO L728 BuchiCegarLoop]: Abstraction has 551 states and 803 transitions. [2018-11-18 13:23:26,770 INFO L608 BuchiCegarLoop]: Abstraction has 551 states and 803 transitions. [2018-11-18 13:23:26,770 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 13:23:26,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 803 transitions. [2018-11-18 13:23:26,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-18 13:23:26,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:26,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:26,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1] [2018-11-18 13:23:26,772 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] [2018-11-18 13:23:26,773 INFO L794 eck$LassoCheckResult]: Stem: 25219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 24995#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 24996#L116-3 assume true; 25347#L116-1 assume !!(add_history_type_~var~0 < 3); 25310#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25171#L171 assume 0 == read_history_bool_~history_id; 25172#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 24971#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 25154#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 25155#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 25348#L116-3 assume true; 25349#L116-1 assume !(add_history_type_~var~0 < 3); 25345#L116-4 add_history_type_#res := 1; 25192#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 25193#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25297#L116-8 assume true; 25366#L116-6 assume !!(add_history_type_~var~0 < 3); 25294#L117-2 assume !(0 == add_history_type_~history_id); 25295#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25350#L171-4 assume !(0 == read_history_bool_~history_id); 25229#L181-4 assume 1 == read_history_bool_~history_id; 25230#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25136#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25030#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 25031#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 25367#L116-8 assume true; 25368#L116-6 assume !(add_history_type_~var~0 < 3); 25362#L116-9 add_history_type_#res := 1; 25223#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 25185#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25186#L116-13 assume true; 25401#L116-11 assume !!(add_history_type_~var~0 < 3); 25286#L117-4 assume !(0 == add_history_type_~history_id); 25287#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25373#L171-7 assume !(0 == read_history_bool_~history_id); 25255#L181-7 assume 1 == read_history_bool_~history_id; 25256#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25083#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25024#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25009#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 24978#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 24979#L116-18 assume true; 25337#L116-16 assume !!(add_history_type_~var~0 < 3); 25274#L117-6 assume !(0 == add_history_type_~history_id); 25275#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25363#L171-10 assume !(0 == read_history_bool_~history_id); 25243#L181-10 assume 1 == read_history_bool_~history_id; 25244#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25061#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25017#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25003#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 25220#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 25188#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 25189#L558-3 [2018-11-18 13:23:26,773 INFO L796 eck$LassoCheckResult]: Loop: 25189#L558-3 assume true; 25393#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25182#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 25183#L236-2 assume { :end_inline_write_history_bool } true; 25267#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 25232#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 25177#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 25187#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 25346#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 25280#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25169#L226-2 assume !(0 == write_history_bool_~history_id); 25170#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 25197#L236-5 assume { :end_inline_write_history_bool } true; 25234#L421 assume 0 != ~gate2Failed~0 % 256; 25113#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 25064#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 25065#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25226#L226-4 assume !(0 == write_history_bool_~history_id); 25221#L231-4 assume !(1 == write_history_bool_~history_id); 25222#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 25227#L236-8 assume { :end_inline_write_history_bool } true; 25261#L452 assume 0 != ~gate3Failed~0 % 256; 25305#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 25282#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 25283#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 25302#L486 assume ~VALUE1~0 == ~VALUE2~0; 25304#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 24988#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 25395#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 25342#L211-2 assume { :end_inline_write_history_int8 } true; 25388#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 25389#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 25387#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25355#L171-12 assume 0 == read_history_bool_~history_id; 25299#L172-12 assume !(0 == read_history_bool_~historyIndex); 25271#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 25109#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 24999#L307 assume !(0 == check_~tmp___3~0 % 256); 25000#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 25007#L151-7 assume 3 == read_history_int8_~history_id; 25071#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 25072#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 25078#L346 assume !(check_~tmp___10~0 > -2); 25262#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 25263#L151-9 assume 3 == read_history_int8_~history_id; 25057#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 25059#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 25066#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 25132#L366-1 check_#res := 1; 25122#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25123#L583-72 assume !(0 == assert_~arg % 256); 25296#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 25189#L558-3 [2018-11-18 13:23:26,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 2 times [2018-11-18 13:23:26,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:23:26,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:26,801 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:26,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:26,801 INFO L82 PathProgramCache]: Analyzing trace with hash 204498799, now seen corresponding path program 1 times [2018-11-18 13:23:26,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:26,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:26,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:26,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:26,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:23:26,849 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:23:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:23:26,849 INFO L87 Difference]: Start difference. First operand 551 states and 803 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-18 13:23:27,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:27,009 INFO L93 Difference]: Finished difference Result 1562 states and 2248 transitions. [2018-11-18 13:23:27,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:23:27,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1562 states and 2248 transitions. [2018-11-18 13:23:27,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 631 [2018-11-18 13:23:27,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1562 states to 1562 states and 2248 transitions. [2018-11-18 13:23:27,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1280 [2018-11-18 13:23:27,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1280 [2018-11-18 13:23:27,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1562 states and 2248 transitions. [2018-11-18 13:23:27,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:27,018 INFO L705 BuchiCegarLoop]: Abstraction has 1562 states and 2248 transitions. [2018-11-18 13:23:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states and 2248 transitions. [2018-11-18 13:23:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 551. [2018-11-18 13:23:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-11-18 13:23:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 802 transitions. [2018-11-18 13:23:27,025 INFO L728 BuchiCegarLoop]: Abstraction has 551 states and 802 transitions. [2018-11-18 13:23:27,025 INFO L608 BuchiCegarLoop]: Abstraction has 551 states and 802 transitions. [2018-11-18 13:23:27,025 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 13:23:27,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 802 transitions. [2018-11-18 13:23:27,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-18 13:23:27,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:27,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:27,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1] [2018-11-18 13:23:27,027 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] [2018-11-18 13:23:27,027 INFO L794 eck$LassoCheckResult]: Stem: 27343#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 27119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27120#L116-3 assume true; 27470#L116-1 assume !!(add_history_type_~var~0 < 3); 27433#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27295#L171 assume 0 == read_history_bool_~history_id; 27296#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 27092#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 27278#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 27279#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 27471#L116-3 assume true; 27472#L116-1 assume !(add_history_type_~var~0 < 3); 27467#L116-4 add_history_type_#res := 1; 27315#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 27316#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27420#L116-8 assume true; 27489#L116-6 assume !!(add_history_type_~var~0 < 3); 27417#L117-2 assume !(0 == add_history_type_~history_id); 27418#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27473#L171-4 assume !(0 == read_history_bool_~history_id); 27353#L181-4 assume 1 == read_history_bool_~history_id; 27354#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27258#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27154#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 27155#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 27490#L116-8 assume true; 27491#L116-6 assume !(add_history_type_~var~0 < 3); 27485#L116-9 add_history_type_#res := 1; 27347#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 27309#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27310#L116-13 assume true; 27521#L116-11 assume !!(add_history_type_~var~0 < 3); 27409#L117-4 assume !(0 == add_history_type_~history_id); 27410#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27495#L171-7 assume !(0 == read_history_bool_~history_id); 27379#L181-7 assume 1 == read_history_bool_~history_id; 27380#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27204#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27148#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27132#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 27102#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27103#L116-18 assume true; 27460#L116-16 assume !!(add_history_type_~var~0 < 3); 27398#L117-6 assume !(0 == add_history_type_~history_id); 27399#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27486#L171-10 assume !(0 == read_history_bool_~history_id); 27367#L181-10 assume 1 == read_history_bool_~history_id; 27368#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27182#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27141#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27124#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 27344#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 27312#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 27313#L558-3 [2018-11-18 13:23:27,028 INFO L796 eck$LassoCheckResult]: Loop: 27313#L558-3 assume true; 27517#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27306#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 27307#L236-2 assume { :end_inline_write_history_bool } true; 27391#L390 assume 0 != ~gate1Failed~0 % 256; 27302#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 27303#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 27314#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27293#L226-2 assume !(0 == write_history_bool_~history_id); 27294#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 27319#L236-5 assume { :end_inline_write_history_bool } true; 27358#L421 assume 0 != ~gate2Failed~0 % 256; 27515#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 27619#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 27617#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27615#L226-4 assume !(0 == write_history_bool_~history_id); 27614#L231-4 assume !(1 == write_history_bool_~history_id); 27611#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 27609#L236-8 assume { :end_inline_write_history_bool } true; 27607#L452 assume 0 != ~gate3Failed~0 % 256; 27606#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 27601#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 27598#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 27596#L486 assume ~VALUE1~0 == ~VALUE2~0; 27569#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 27561#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 27520#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 27466#L211-2 assume { :end_inline_write_history_int8 } true; 27512#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 27513#L294 assume !(0 == ~gate1Failed~0 % 256); 27338#L297 assume !(0 == ~gate2Failed~0 % 256); 27339#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 27511#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27478#L171-12 assume 0 == read_history_bool_~history_id; 27422#L172-12 assume !(0 == read_history_bool_~historyIndex); 27395#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 27234#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 27128#L307 assume !(0 == check_~tmp___3~0 % 256); 27129#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 27136#L151-7 assume !(3 == read_history_int8_~history_id);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 27438#L583-54 assume !(0 == assert_~arg % 256); 27439#L578-27 assume { :end_inline_assert } true;read_history_int8_#res := -2; 27201#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 27202#L346 assume !(check_~tmp___10~0 > -2); 27386#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 27387#L151-9 assume 3 == read_history_int8_~history_id; 27187#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 27189#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 27190#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 27256#L366-1 check_#res := 1; 27246#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 27247#L583-72 assume !(0 == assert_~arg % 256); 27419#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 27313#L558-3 [2018-11-18 13:23:27,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:27,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 3 times [2018-11-18 13:23:27,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:27,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:27,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:27,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:23:27,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:27,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:27,056 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:27,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:27,056 INFO L82 PathProgramCache]: Analyzing trace with hash -783601893, now seen corresponding path program 1 times [2018-11-18 13:23:27,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:27,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:27,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:27,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:27,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:27,070 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:27,071 INFO L87 Difference]: Start difference. First operand 551 states and 802 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-11-18 13:23:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:27,086 INFO L93 Difference]: Finished difference Result 830 states and 1206 transitions. [2018-11-18 13:23:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:27,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 830 states and 1206 transitions. [2018-11-18 13:23:27,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 618 [2018-11-18 13:23:27,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 830 states to 830 states and 1206 transitions. [2018-11-18 13:23:27,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 715 [2018-11-18 13:23:27,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 715 [2018-11-18 13:23:27,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1206 transitions. [2018-11-18 13:23:27,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:27,092 INFO L705 BuchiCegarLoop]: Abstraction has 830 states and 1206 transitions. [2018-11-18 13:23:27,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1206 transitions. [2018-11-18 13:23:27,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 630. [2018-11-18 13:23:27,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-11-18 13:23:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 924 transitions. [2018-11-18 13:23:27,099 INFO L728 BuchiCegarLoop]: Abstraction has 630 states and 924 transitions. [2018-11-18 13:23:27,099 INFO L608 BuchiCegarLoop]: Abstraction has 630 states and 924 transitions. [2018-11-18 13:23:27,099 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 13:23:27,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 630 states and 924 transitions. [2018-11-18 13:23:27,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 418 [2018-11-18 13:23:27,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:27,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:27,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1] [2018-11-18 13:23:27,101 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] [2018-11-18 13:23:27,101 INFO L794 eck$LassoCheckResult]: Stem: 28731#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 28507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28508#L116-3 assume true; 28860#L116-1 assume !!(add_history_type_~var~0 < 3); 28823#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28683#L171 assume 0 == read_history_bool_~history_id; 28684#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 28480#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 28666#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 28667#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 28861#L116-3 assume true; 28862#L116-1 assume !(add_history_type_~var~0 < 3); 28857#L116-4 add_history_type_#res := 1; 28703#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 28704#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28810#L116-8 assume true; 28878#L116-6 assume !!(add_history_type_~var~0 < 3); 28807#L117-2 assume !(0 == add_history_type_~history_id); 28808#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28863#L171-4 assume !(0 == read_history_bool_~history_id); 28742#L181-4 assume 1 == read_history_bool_~history_id; 28743#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 28646#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28542#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 28543#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 28879#L116-8 assume true; 28880#L116-6 assume !(add_history_type_~var~0 < 3); 28874#L116-9 add_history_type_#res := 1; 28735#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 28697#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28698#L116-13 assume true; 28912#L116-11 assume !!(add_history_type_~var~0 < 3); 28799#L117-4 assume !(0 == add_history_type_~history_id); 28800#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28884#L171-7 assume !(0 == read_history_bool_~history_id); 28768#L181-7 assume 1 == read_history_bool_~history_id; 28769#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 28592#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28536#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 28520#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 28490#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28491#L116-18 assume true; 28850#L116-16 assume !!(add_history_type_~var~0 < 3); 28787#L117-6 assume !(0 == add_history_type_~history_id); 28788#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28875#L171-10 assume !(0 == read_history_bool_~history_id); 28756#L181-10 assume 1 == read_history_bool_~history_id; 28757#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 28570#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28529#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 28512#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 28732#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 28700#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 28701#L558-3 [2018-11-18 13:23:27,102 INFO L796 eck$LassoCheckResult]: Loop: 28701#L558-3 assume true; 28903#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 28694#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 28695#L236-2 assume { :end_inline_write_history_bool } true; 28780#L390 assume 0 != ~gate1Failed~0 % 256; 28690#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 28691#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 28702#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29107#L226-2 assume !(0 == write_history_bool_~history_id); 29105#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 29102#L236-5 assume { :end_inline_write_history_bool } true; 29100#L421 assume 0 != ~gate2Failed~0 % 256; 29101#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 29108#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 28738#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 28739#L226-4 assume !(0 == write_history_bool_~history_id); 28733#L231-4 assume !(1 == write_history_bool_~history_id); 28734#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 28740#L236-8 assume { :end_inline_write_history_bool } true; 28774#L452 assume 0 != ~gate3Failed~0 % 256; 28818#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 28795#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 28796#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 28815#L486 assume ~VALUE1~0 == ~VALUE2~0; 28817#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 28506#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 28904#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 28856#L211-2 assume { :end_inline_write_history_int8 } true; 28899#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 28900#L294 assume !(0 == ~gate1Failed~0 % 256); 28726#L297 assume !(0 == ~gate2Failed~0 % 256); 28727#L300 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2 := 0; 28898#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28867#L171-12 assume 0 == read_history_bool_~history_id; 28812#L172-12 assume !(0 == read_history_bool_~historyIndex); 28784#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 28622#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 28516#L307 assume !(0 == check_~tmp___3~0 % 256); 28517#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 28524#L151-7 assume 3 == read_history_int8_~history_id; 28587#L152-7 assume !(0 == read_history_int8_~historyIndex); 28588#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 28589#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 28590#L346 assume !(check_~tmp___10~0 > -2); 28775#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 28776#L151-9 assume 3 == read_history_int8_~history_id; 28575#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 28577#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 28578#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 28644#L366-1 check_#res := 1; 28634#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 28635#L583-72 assume !(0 == assert_~arg % 256); 28809#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 28701#L558-3 [2018-11-18 13:23:27,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 4 times [2018-11-18 13:23:27,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:23:27,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:27,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:27,147 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:27,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash -658411516, now seen corresponding path program 1 times [2018-11-18 13:23:27,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:27,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:27,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:27,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:27,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:27,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:27,175 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:23:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:27,176 INFO L87 Difference]: Start difference. First operand 630 states and 924 transitions. cyclomatic complexity: 301 Second operand 3 states. [2018-11-18 13:23:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:27,192 INFO L93 Difference]: Finished difference Result 631 states and 924 transitions. [2018-11-18 13:23:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:27,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 631 states and 924 transitions. [2018-11-18 13:23:27,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-18 13:23:27,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 631 states to 607 states and 887 transitions. [2018-11-18 13:23:27,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 492 [2018-11-18 13:23:27,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 492 [2018-11-18 13:23:27,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 607 states and 887 transitions. [2018-11-18 13:23:27,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:27,197 INFO L705 BuchiCegarLoop]: Abstraction has 607 states and 887 transitions. [2018-11-18 13:23:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states and 887 transitions. [2018-11-18 13:23:27,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2018-11-18 13:23:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-18 13:23:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 887 transitions. [2018-11-18 13:23:27,202 INFO L728 BuchiCegarLoop]: Abstraction has 607 states and 887 transitions. [2018-11-18 13:23:27,202 INFO L608 BuchiCegarLoop]: Abstraction has 607 states and 887 transitions. [2018-11-18 13:23:27,202 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 13:23:27,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 887 transitions. [2018-11-18 13:23:27,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-18 13:23:27,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:27,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:27,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1] [2018-11-18 13:23:27,205 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] [2018-11-18 13:23:27,205 INFO L794 eck$LassoCheckResult]: Stem: 29999#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 29775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29776#L116-3 assume true; 30126#L116-1 assume !!(add_history_type_~var~0 < 3); 30090#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 29951#L171 assume 0 == read_history_bool_~history_id; 29952#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 29751#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 29934#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 29935#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 30127#L116-3 assume true; 30128#L116-1 assume !(add_history_type_~var~0 < 3); 30123#L116-4 add_history_type_#res := 1; 29972#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 29973#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 30077#L116-8 assume true; 30144#L116-6 assume !!(add_history_type_~var~0 < 3); 30074#L117-2 assume !(0 == add_history_type_~history_id); 30075#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30129#L171-4 assume !(0 == read_history_bool_~history_id); 30009#L181-4 assume 1 == read_history_bool_~history_id; 30010#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 29914#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29810#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 29811#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 30145#L116-8 assume true; 30146#L116-6 assume !(add_history_type_~var~0 < 3); 30140#L116-9 add_history_type_#res := 1; 30003#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 29965#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29966#L116-13 assume true; 30107#L116-11 assume !!(add_history_type_~var~0 < 3); 30066#L117-4 assume !(0 == add_history_type_~history_id); 30067#L123-4 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30150#L171-7 assume !(0 == read_history_bool_~history_id); 30035#L181-7 assume 1 == read_history_bool_~history_id; 30036#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 29863#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29804#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29788#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 29758#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29759#L116-18 assume true; 30116#L116-16 assume !!(add_history_type_~var~0 < 3); 30054#L117-6 assume !(0 == add_history_type_~history_id); 30055#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30141#L171-10 assume !(0 == read_history_bool_~history_id); 30023#L181-10 assume 1 == read_history_bool_~history_id; 30024#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 29838#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29797#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29780#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 30000#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 29968#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 29969#L558-3 [2018-11-18 13:23:27,205 INFO L796 eck$LassoCheckResult]: Loop: 29969#L558-3 assume true; 30172#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29962#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 29963#L236-2 assume { :end_inline_write_history_bool } true; 30047#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 30012#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 29957#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 29967#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 30125#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 30060#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29949#L226-2 assume !(0 == write_history_bool_~history_id); 29950#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 29975#L236-5 assume { :end_inline_write_history_bool } true; 30014#L421 assume 0 != ~gate2Failed~0 % 256; 29888#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 29841#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 29842#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 30256#L226-4 assume !(0 == write_history_bool_~history_id); 30255#L231-4 assume !(1 == write_history_bool_~history_id); 30251#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 30250#L236-8 assume { :end_inline_write_history_bool } true; 30249#L452 assume 0 != ~gate3Failed~0 % 256; 30085#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 30062#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 30063#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 30082#L486 assume ~VALUE1~0 == ~VALUE2~0; 30084#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 29774#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 30174#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 30319#L211-2 assume { :end_inline_write_history_int8 } true; 30166#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 30167#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 30165#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30133#L171-12 assume 0 == read_history_bool_~history_id; 30079#L172-12 assume !(0 == read_history_bool_~historyIndex); 30051#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 29890#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 29784#L307 assume !(0 == check_~tmp___3~0 % 256); 29785#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 29792#L151-7 assume 3 == read_history_int8_~history_id; 29855#L152-7 assume !(0 == read_history_int8_~historyIndex); 29856#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 29857#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 29858#L346 assume !(check_~tmp___10~0 > -2); 30042#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 30043#L151-9 assume 3 == read_history_int8_~history_id; 29843#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 29845#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 29846#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 29911#L366-1 check_#res := 1; 29902#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 29903#L583-72 assume !(0 == assert_~arg % 256); 30076#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 29969#L558-3 [2018-11-18 13:23:27,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 5 times [2018-11-18 13:23:27,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:27,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:27,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:23:27,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:27,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:23:27,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:27,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash 459587620, now seen corresponding path program 1 times [2018-11-18 13:23:27,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:27,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:23:27,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:27,837 WARN L180 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 216 [2018-11-18 13:23:29,389 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 187 DAG size of output: 168 [2018-11-18 13:23:29,390 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:29,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:29,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:29,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:29,391 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:23:29,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:29,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:29,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:29,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration17_Loop [2018-11-18 13:23:29,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:29,391 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:29,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,543 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-18 13:23:29,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,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-18 13:23:29,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,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-18 13:23:29,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,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-18 13:23:29,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,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-18 13:23:29,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,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-18 13:23:29,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-18 13:23:29,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,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-18 13:23:29,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-18 13:23:29,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:29,875 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-18 13:23:32,430 WARN L180 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-18 13:23:32,522 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:32,522 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:32,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:32,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:32,529 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:32,529 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:32,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:32,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:32,547 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:32,547 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:32,562 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:32,562 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:32,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:23:32,564 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:32,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:23:32,579 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:32,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:23:32,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:23:44,746 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 13:23:44,752 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:44,752 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:44,752 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:44,752 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:44,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:23:44,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:44,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:44,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:44,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration17_Loop [2018-11-18 13:23:44,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:44,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:44,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,906 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-18 13:23:44,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:44,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:45,213 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-18 13:23:47,661 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-18 13:23:47,767 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:23:47,767 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:23:47,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-18 13:23:47,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:47,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:47,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:47,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:47,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:47,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:47,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:47,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:47,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-18 13:23:47,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:47,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:47,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:47,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:47,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:47,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:47,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:47,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:47,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-18 13:23:47,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:47,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:47,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:47,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:47,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:47,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:47,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:47,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:47,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:23:47,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:47,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:47,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:47,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:47,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:47,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:47,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:47,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:47,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-18 13:23:47,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:47,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:47,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:47,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:47,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:47,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:47,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:47,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:47,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-18 13:23:47,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:47,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:47,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:47,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:23:47,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:47,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:23:47,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:47,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:23:47,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-18 13:23:47,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:23:47,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:23:47,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:23:47,779 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-18 13:23:47,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:23:47,795 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 13:23:47,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:23:47,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:23:48,044 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:23:48,044 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:23:48,044 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:23:48,045 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:23:48,045 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:23:48,045 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g1v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g1v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-18 13:23:48,045 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:23:48,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:48,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:48,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:23:48,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:23:48,281 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2018-11-18 13:23:48,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 607 states and 887 transitions. cyclomatic complexity: 287 Second operand 16 states. [2018-11-18 13:23:49,142 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 607 states and 887 transitions. cyclomatic complexity: 287. Second operand 16 states. Result 4524 states and 6218 transitions. Complement of second has 37 states. [2018-11-18 13:23:49,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-18 13:23:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 13:23:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1701 transitions. [2018-11-18 13:23:49,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1701 transitions. Stem has 53 letters. Loop has 53 letters. [2018-11-18 13:23:49,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:49,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1701 transitions. Stem has 106 letters. Loop has 53 letters. [2018-11-18 13:23:49,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:49,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1701 transitions. Stem has 53 letters. Loop has 106 letters. [2018-11-18 13:23:49,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:23:49,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4524 states and 6218 transitions. [2018-11-18 13:23:49,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-18 13:23:49,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4524 states to 2788 states and 3895 transitions. [2018-11-18 13:23:49,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2449 [2018-11-18 13:23:49,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2451 [2018-11-18 13:23:49,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2788 states and 3895 transitions. [2018-11-18 13:23:49,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:49,164 INFO L705 BuchiCegarLoop]: Abstraction has 2788 states and 3895 transitions. [2018-11-18 13:23:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states and 3895 transitions. [2018-11-18 13:23:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1023. [2018-11-18 13:23:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-18 13:23:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1469 transitions. [2018-11-18 13:23:49,177 INFO L728 BuchiCegarLoop]: Abstraction has 1023 states and 1469 transitions. [2018-11-18 13:23:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:23:49,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:23:49,177 INFO L87 Difference]: Start difference. First operand 1023 states and 1469 transitions. Second operand 3 states. [2018-11-18 13:23:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:23:49,221 INFO L93 Difference]: Finished difference Result 1805 states and 2570 transitions. [2018-11-18 13:23:49,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:23:49,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1805 states and 2570 transitions. [2018-11-18 13:23:49,226 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 790 [2018-11-18 13:23:49,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1805 states to 1805 states and 2570 transitions. [2018-11-18 13:23:49,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1292 [2018-11-18 13:23:49,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1292 [2018-11-18 13:23:49,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1805 states and 2570 transitions. [2018-11-18 13:23:49,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:23:49,231 INFO L705 BuchiCegarLoop]: Abstraction has 1805 states and 2570 transitions. [2018-11-18 13:23:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states and 2570 transitions. [2018-11-18 13:23:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 987. [2018-11-18 13:23:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2018-11-18 13:23:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1407 transitions. [2018-11-18 13:23:49,241 INFO L728 BuchiCegarLoop]: Abstraction has 987 states and 1407 transitions. [2018-11-18 13:23:49,241 INFO L608 BuchiCegarLoop]: Abstraction has 987 states and 1407 transitions. [2018-11-18 13:23:49,241 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 13:23:49,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 987 states and 1407 transitions. [2018-11-18 13:23:49,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-18 13:23:49,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:23:49,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:23:49,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:23:49,247 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] [2018-11-18 13:23:49,247 INFO L794 eck$LassoCheckResult]: Stem: 38428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 38156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38157#L116-3 assume true; 38602#L116-1 assume !!(add_history_type_~var~0 < 3); 38544#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38361#L171 assume 0 == read_history_bool_~history_id; 38362#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 38120#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 38344#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 38345#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 38603#L116-3 assume true; 38604#L116-1 assume !(add_history_type_~var~0 < 3); 38597#L116-4 add_history_type_#res := 1; 38385#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 38386#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38521#L116-8 assume true; 38627#L116-6 assume !!(add_history_type_~var~0 < 3); 38517#L117-2 assume !(0 == add_history_type_~history_id); 38518#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38605#L171-4 assume !(0 == read_history_bool_~history_id); 38443#L181-4 assume 1 == read_history_bool_~history_id; 38444#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38333#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38199#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 38200#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 38628#L116-8 assume true; 38629#L116-6 assume !(add_history_type_~var~0 < 3); 38622#L116-9 add_history_type_#res := 1; 38434#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 38376#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38377#L116-13 assume true; 38569#L116-11 assume !!(add_history_type_~var~0 < 3); 38511#L117-4 assume !(0 == add_history_type_~history_id); 38512#L123-4 assume !(1 == add_history_type_~history_id); 38650#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38632#L171-8 assume !(0 == read_history_bool_~history_id); 38467#L181-8 assume 1 == read_history_bool_~history_id; 38468#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38248#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 38175#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38176#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 38130#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38131#L116-18 assume true; 38686#L116-16 assume !!(add_history_type_~var~0 < 3); 38494#L117-6 assume !(0 == add_history_type_~history_id); 38495#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38625#L171-10 assume !(0 == read_history_bool_~history_id); 38461#L181-10 assume 1 == read_history_bool_~history_id; 38462#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 38229#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38185#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38169#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 38429#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 38381#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 38382#L558-3 assume true; 38668#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 38669#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 38847#L236-2 assume { :end_inline_write_history_bool } true; 38845#L390 assume 0 != ~gate1Failed~0 % 256; 38368#L391 [2018-11-18 13:23:49,247 INFO L796 eck$LassoCheckResult]: Loop: 38368#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 38369#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 38383#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 39013#L226-2 assume !(0 == write_history_bool_~history_id); 39005#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 39001#L236-5 assume { :end_inline_write_history_bool } true; 38996#L421 assume !(0 != ~gate2Failed~0 % 256);gate2_each_pals_period_~tmp~4 := gate2_each_pals_period_#t~nondet33;havoc gate2_each_pals_period_#t~nondet33;gate2_each_pals_period_~next_state~1 := gate2_each_pals_period_~tmp~4; 38994#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 38990#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 38988#L439 assume !(gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite34 := ~g2v_new~0; 38986#L439-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite34 % 256 <= 127 then gate2_each_pals_period_#t~ite34 % 256 else gate2_each_pals_period_#t~ite34 % 256 - 256);havoc gate2_each_pals_period_#t~ite34; 38984#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 38982#L226-4 assume !(0 == write_history_bool_~history_id); 38980#L231-4 assume !(1 == write_history_bool_~history_id); 38926#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 38925#L236-8 assume { :end_inline_write_history_bool } true; 38923#L452 assume 0 != ~gate3Failed~0 % 256; 38924#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 39069#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 39067#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 39065#L486 assume ~VALUE1~0 == ~VALUE2~0; 39061#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 39051#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 39047#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 39046#L211-2 assume { :end_inline_write_history_int8 } true; 39045#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 38661#L294 assume !(0 == ~gate1Failed~0 % 256); 38662#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 38654#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38613#L171-12 assume 0 == read_history_bool_~history_id; 38614#L172-12 assume !(0 == read_history_bool_~historyIndex); 38490#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 38298#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 38454#L307 assume !(0 == check_~tmp___3~0 % 256); 38726#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 38696#L151-7 assume 3 == read_history_int8_~history_id; 38694#L152-7 assume !(0 == read_history_int8_~historyIndex); 38692#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 38541#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 38691#L346 assume !(check_~tmp___10~0 > -2); 38510#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 38690#L151-9 assume 3 == read_history_int8_~history_id; 38689#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 38236#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 38237#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 38329#L366-1 check_#res := 1; 38328#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 38859#L583-72 assume !(0 == assert_~arg % 256); 38858#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 38857#L558-3 assume true; 38856#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 38370#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 38371#L236-2 assume { :end_inline_write_history_bool } true; 38484#L390 assume 0 != ~gate1Failed~0 % 256; 38368#L391 [2018-11-18 13:23:49,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1360593371, now seen corresponding path program 1 times [2018-11-18 13:23:49,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:49,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:49,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:49,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:23:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:23:49,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:23:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:23:49,293 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:23:49,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:23:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1447132877, now seen corresponding path program 1 times [2018-11-18 13:23:49,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:23:49,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:23:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:23:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:23:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:23:49,822 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 221 [2018-11-18 13:23:53,868 WARN L180 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 207 DAG size of output: 184 [2018-11-18 13:23:53,871 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:23:53,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:23:53,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:23:53,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:23:53,872 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:23:53,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:23:53,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:23:53,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:23:53,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration18_Loop [2018-11-18 13:23:53,872 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:23:53,872 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:23:53,875 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 13:23:53,935 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8971 disjunctions. This might take some time... [2018-11-18 13:23:54,123 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 74 disjunctions. [2018-11-18 13:23:54,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,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-18 13:23:54,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,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-18 13:23:54,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,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-18 13:23:54,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,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-18 13:23:54,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,375 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-18 13:23:54,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:23:54,557 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-18 13:23:54,743 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-18 13:23:54,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:24:01,840 WARN L180 SmtUtils]: Spent 6.93 s on a formula simplification. DAG size of input: 320 DAG size of output: 148 [2018-11-18 13:24:01,874 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:24:01,875 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:01,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:01,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:01,890 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:01,890 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret20=0} Honda state: {ULTIMATE.start_check_#t~ret20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-18 13:24:01,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:01,916 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:01,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:01,929 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:01,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:01,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:01,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:01,970 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:01,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:01,987 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:01,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:01,994 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,013 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,017 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,018 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,039 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,069 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,070 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,088 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,093 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,094 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,114 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,114 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,133 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,134 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,153 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,170 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,172 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,188 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,194 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,212 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,229 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,246 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,246 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,254 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,254 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,274 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,274 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:02,295 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_~history_id=3, ULTIMATE.start_write_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_~history_id=3, ULTIMATE.start_write_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:02,311 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:24:02,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:02,455 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 13:24:02,456 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:24:02,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:24:02,456 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:24:02,456 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:24:02,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:24:02,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:02,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:24:02,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:24:02,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration18_Loop [2018-11-18 13:24:02,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:24:02,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:24:02,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-18 13:24:02,489 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8971 disjunctions. This might take some time... [2018-11-18 13:24:02,675 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 74 disjunctions. [2018-11-18 13:24:02,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,829 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-18 13:24:02,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,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-18 13:24:02,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:02,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-18 13:24:02,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:03,108 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-18 13:24:03,242 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-18 13:24:03,329 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:24:10,300 WARN L180 SmtUtils]: Spent 6.96 s on a formula simplification. DAG size of input: 320 DAG size of output: 148 [2018-11-18 13:24:10,420 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:24:10,420 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:24:10,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,423 INFO L206 nArgumentSynthesizer]: 20 loop disjuncts [2018-11-18 13:24:10,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,448 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-18 13:24:10,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:10,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:10,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:10,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:10,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:10,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:10,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:10,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:10,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:10,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:10,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:10,708 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:24:10,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:24:10,709 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:24:10,709 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:24:10,709 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:24:10,709 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:24:10,710 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-18 13:24:10,710 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:24:10,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:10,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:10,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:24:10,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:24:10,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 987 states and 1407 transitions. cyclomatic complexity: 428 Second operand 5 states. [2018-11-18 13:24:10,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 987 states and 1407 transitions. cyclomatic complexity: 428. Second operand 5 states. Result 1674 states and 2405 transitions. Complement of second has 6 states. [2018-11-18 13:24:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:24:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:24:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 767 transitions. [2018-11-18 13:24:10,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 767 transitions. Stem has 59 letters. Loop has 54 letters. [2018-11-18 13:24:10,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:10,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 767 transitions. Stem has 113 letters. Loop has 54 letters. [2018-11-18 13:24:10,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:10,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 767 transitions. Stem has 59 letters. Loop has 108 letters. [2018-11-18 13:24:10,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:10,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1674 states and 2405 transitions. [2018-11-18 13:24:10,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2018-11-18 13:24:10,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1674 states to 882 states and 1252 transitions. [2018-11-18 13:24:10,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2018-11-18 13:24:10,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2018-11-18 13:24:10,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 882 states and 1252 transitions. [2018-11-18 13:24:10,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:24:10,959 INFO L705 BuchiCegarLoop]: Abstraction has 882 states and 1252 transitions. [2018-11-18 13:24:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states and 1252 transitions. [2018-11-18 13:24:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2018-11-18 13:24:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-18 13:24:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1252 transitions. [2018-11-18 13:24:10,964 INFO L728 BuchiCegarLoop]: Abstraction has 882 states and 1252 transitions. [2018-11-18 13:24:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:24:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:24:10,964 INFO L87 Difference]: Start difference. First operand 882 states and 1252 transitions. Second operand 4 states. [2018-11-18 13:24:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:24:11,045 INFO L93 Difference]: Finished difference Result 2569 states and 3626 transitions. [2018-11-18 13:24:11,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:24:11,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2569 states and 3626 transitions. [2018-11-18 13:24:11,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 956 [2018-11-18 13:24:11,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2569 states to 2569 states and 3626 transitions. [2018-11-18 13:24:11,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1758 [2018-11-18 13:24:11,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1758 [2018-11-18 13:24:11,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2569 states and 3626 transitions. [2018-11-18 13:24:11,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:24:11,058 INFO L705 BuchiCegarLoop]: Abstraction has 2569 states and 3626 transitions. [2018-11-18 13:24:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states and 3626 transitions. [2018-11-18 13:24:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 856. [2018-11-18 13:24:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-18 13:24:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1203 transitions. [2018-11-18 13:24:11,070 INFO L728 BuchiCegarLoop]: Abstraction has 856 states and 1203 transitions. [2018-11-18 13:24:11,070 INFO L608 BuchiCegarLoop]: Abstraction has 856 states and 1203 transitions. [2018-11-18 13:24:11,070 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 13:24:11,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 856 states and 1203 transitions. [2018-11-18 13:24:11,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-18 13:24:11,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:24:11,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:24:11,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:24:11,072 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] [2018-11-18 13:24:11,072 INFO L794 eck$LassoCheckResult]: Stem: 44885#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 44634#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44635#L116-3 assume true; 45064#L116-1 assume !!(add_history_type_~var~0 < 3); 44999#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 44819#L171 assume 0 == read_history_bool_~history_id; 44820#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 44595#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 44801#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 44802#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 45065#L116-3 assume true; 45066#L116-1 assume !(add_history_type_~var~0 < 3); 45057#L116-4 add_history_type_#res := 1; 44839#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 44840#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44979#L116-8 assume true; 45090#L116-6 assume !!(add_history_type_~var~0 < 3); 44975#L117-2 assume !(0 == add_history_type_~history_id); 44976#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45067#L171-4 assume !(0 == read_history_bool_~history_id); 44899#L181-4 assume 1 == read_history_bool_~history_id; 44900#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 44788#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44677#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 44678#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 45091#L116-8 assume true; 45092#L116-6 assume !(add_history_type_~var~0 < 3); 45085#L116-9 add_history_type_#res := 1; 44891#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 44831#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44832#L116-13 assume true; 45027#L116-11 assume !!(add_history_type_~var~0 < 3); 44968#L117-4 assume !(0 == add_history_type_~history_id); 44969#L123-4 assume !(1 == add_history_type_~history_id); 45115#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45095#L171-8 assume !(0 == read_history_bool_~history_id); 44926#L181-8 assume !(1 == read_history_bool_~history_id); 44693#L191-8 assume 2 == read_history_bool_~history_id; 44695#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 44804#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 44651#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 44652#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 44608#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44609#L116-18 assume true; 45149#L116-16 assume !!(add_history_type_~var~0 < 3); 44952#L117-6 assume !(0 == add_history_type_~history_id); 44954#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45086#L171-10 assume !(0 == read_history_bool_~history_id); 44920#L181-10 assume 1 == read_history_bool_~history_id; 44921#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 44700#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44663#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 44641#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 44886#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 44837#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 44838#L558-3 assume true; 45155#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45385#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44941#L236-2 assume { :end_inline_write_history_bool } true; 44942#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 44902#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 44903#L399 [2018-11-18 13:24:11,072 INFO L796 eck$LassoCheckResult]: Loop: 44903#L399 assume 1 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 44824#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 45378#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 45062#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 45375#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45373#L226-2 assume !(0 == write_history_bool_~history_id); 45371#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 44905#L236-5 assume { :end_inline_write_history_bool } true; 44906#L421 assume 0 != ~gate2Failed~0 % 256; 45130#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 45427#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 45426#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45425#L226-4 assume !(0 == write_history_bool_~history_id); 45424#L231-4 assume !(1 == write_history_bool_~history_id); 45422#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 45420#L236-8 assume { :end_inline_write_history_bool } true; 45418#L452 assume 0 != ~gate3Failed~0 % 256; 44991#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 44962#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 44963#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 44985#L486 assume ~VALUE1~0 == ~VALUE2~0; 44987#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 44630#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 45141#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 45056#L211-2 assume { :end_inline_write_history_int8 } true; 45123#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 45124#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 45180#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45179#L171-12 assume 0 == read_history_bool_~history_id; 44981#L172-12 assume !(0 == read_history_bool_~historyIndex); 44948#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 44911#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 44912#L307 assume !(0 == check_~tmp___3~0 % 256); 45163#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 45162#L151-7 assume !(3 == read_history_int8_~history_id);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 45008#L583-54 assume !(0 == assert_~arg % 256); 45009#L578-27 assume { :end_inline_assert } true;read_history_int8_#res := -2; 44998#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 45159#L346 assume !(check_~tmp___10~0 > -2); 44972#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 45158#L151-9 assume 3 == read_history_int8_~history_id; 45157#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 44996#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 45156#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 44786#L366-1 check_#res := 1; 44772#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 44773#L583-72 assume !(0 == assert_~arg % 256); 44977#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 45000#L558-3 assume true; 45138#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 44825#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44826#L236-2 assume { :end_inline_write_history_bool } true; 45384#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 45381#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 44903#L399 [2018-11-18 13:24:11,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,072 INFO L82 PathProgramCache]: Analyzing trace with hash 260785083, now seen corresponding path program 1 times [2018-11-18 13:24:11,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:11,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:11,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:11,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:24:11,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:24:11,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:24:11,114 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:24:11,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -981140450, now seen corresponding path program 1 times [2018-11-18 13:24:11,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:11,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:11,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:11,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:24:11,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:24:11,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:24:11,132 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:24:11,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:24:11,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:24:11,133 INFO L87 Difference]: Start difference. First operand 856 states and 1203 transitions. cyclomatic complexity: 355 Second operand 3 states. [2018-11-18 13:24:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:24:11,176 INFO L93 Difference]: Finished difference Result 1382 states and 1936 transitions. [2018-11-18 13:24:11,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:24:11,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1382 states and 1936 transitions. [2018-11-18 13:24:11,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 264 [2018-11-18 13:24:11,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1382 states to 1382 states and 1936 transitions. [2018-11-18 13:24:11,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2018-11-18 13:24:11,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 896 [2018-11-18 13:24:11,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1382 states and 1936 transitions. [2018-11-18 13:24:11,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:24:11,189 INFO L705 BuchiCegarLoop]: Abstraction has 1382 states and 1936 transitions. [2018-11-18 13:24:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states and 1936 transitions. [2018-11-18 13:24:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 822. [2018-11-18 13:24:11,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-11-18 13:24:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1150 transitions. [2018-11-18 13:24:11,197 INFO L728 BuchiCegarLoop]: Abstraction has 822 states and 1150 transitions. [2018-11-18 13:24:11,197 INFO L608 BuchiCegarLoop]: Abstraction has 822 states and 1150 transitions. [2018-11-18 13:24:11,197 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 13:24:11,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 822 states and 1150 transitions. [2018-11-18 13:24:11,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 264 [2018-11-18 13:24:11,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:24:11,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:24:11,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:24:11,200 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] [2018-11-18 13:24:11,200 INFO L794 eck$LassoCheckResult]: Stem: 47131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 46880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 46881#L116-3 assume true; 47278#L116-1 assume !!(add_history_type_~var~0 < 3); 47236#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47069#L171 assume 0 == read_history_bool_~history_id; 47070#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 46841#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 47051#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 47052#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 47279#L116-3 assume true; 47280#L116-1 assume !(add_history_type_~var~0 < 3); 47273#L116-4 add_history_type_#res := 1; 47088#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 47089#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 47218#L116-8 assume true; 47297#L116-6 assume !!(add_history_type_~var~0 < 3); 47214#L117-2 assume !(0 == add_history_type_~history_id); 47215#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47281#L171-4 assume !(0 == read_history_bool_~history_id); 47145#L181-4 assume 1 == read_history_bool_~history_id; 47146#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 47038#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 46925#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 46926#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 47298#L116-8 assume true; 47299#L116-6 assume !(add_history_type_~var~0 < 3); 47292#L116-9 add_history_type_#res := 1; 47137#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 47081#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 47082#L116-13 assume true; 47252#L116-11 assume !!(add_history_type_~var~0 < 3); 47209#L117-4 assume !(0 == add_history_type_~history_id); 47210#L123-4 assume !(1 == add_history_type_~history_id); 47323#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47302#L171-8 assume !(0 == read_history_bool_~history_id); 47170#L181-8 assume !(1 == read_history_bool_~history_id); 46941#L191-8 assume 2 == read_history_bool_~history_id; 46943#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 47054#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 46897#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 46898#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 46854#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 46855#L116-18 assume true; 47358#L116-16 assume !!(add_history_type_~var~0 < 3); 47195#L117-6 assume !(0 == add_history_type_~history_id); 47197#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47293#L171-10 assume !(0 == read_history_bool_~history_id); 47164#L181-10 assume 1 == read_history_bool_~history_id; 47165#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 46948#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 46910#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 46887#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 47132#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 47086#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 47087#L558-3 assume true; 47362#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47511#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 47509#L236-2 assume { :end_inline_write_history_bool } true; 47508#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 47507#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 47149#L399 [2018-11-18 13:24:11,200 INFO L796 eck$LassoCheckResult]: Loop: 47149#L399 assume 1 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 47074#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 47083#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 47276#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 47201#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47065#L226-2 assume !(0 == write_history_bool_~history_id); 47066#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 47093#L236-5 assume { :end_inline_write_history_bool } true; 47151#L421 assume 0 != ~gate2Failed~0 % 256; 47336#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 47501#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 47496#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47494#L226-4 assume !(0 == write_history_bool_~history_id); 47492#L231-4 assume !(1 == write_history_bool_~history_id); 47484#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 47482#L236-8 assume { :end_inline_write_history_bool } true; 47480#L452 assume 0 != ~gate3Failed~0 % 256; 47230#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 47205#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 47206#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 47224#L486 assume ~VALUE1~0 == ~VALUE2~0; 47226#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 46914#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 47611#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 47272#L211-2 assume { :end_inline_write_history_int8 } true; 47345#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 47395#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 47393#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47391#L171-12 assume 0 == read_history_bool_~history_id; 47388#L172-12 assume !(0 == read_history_bool_~historyIndex); 47386#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 47383#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 47366#L307 assume !(0 == check_~tmp___3~0 % 256); 46902#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 46903#L151-7 assume 3 == read_history_int8_~history_id; 47312#L152-7 assume !(0 == read_history_int8_~historyIndex); 47357#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 47235#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 47356#L346 assume !(check_~tmp___10~0 > -2); 47213#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 47355#L151-9 assume 3 == read_history_int8_~history_id; 47354#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 47233#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 47353#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 47036#L366-1 check_#res := 1; 47035#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 47523#L583-72 assume !(0 == assert_~arg % 256); 47237#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 47238#L558-3 assume true; 47343#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47075#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 47076#L236-2 assume { :end_inline_write_history_bool } true; 47185#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 47148#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 47149#L399 [2018-11-18 13:24:11,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,200 INFO L82 PathProgramCache]: Analyzing trace with hash 260785083, now seen corresponding path program 2 times [2018-11-18 13:24:11,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:11,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:11,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:11,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:24:11,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:24:11,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:24:11,242 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:24:11,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1355474039, now seen corresponding path program 1 times [2018-11-18 13:24:11,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:11,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:11,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:24:11,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:11,783 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 222 [2018-11-18 13:24:13,313 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2018-11-18 13:24:13,315 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:24:13,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:24:13,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:24:13,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:24:13,315 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:24:13,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:13,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:24:13,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:24:13,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-18 13:24:13,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:24:13,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:24:13,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,467 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-18 13:24:13,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,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-18 13:24:13,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:13,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-18 13:24:13,723 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-18 13:24:13,863 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-18 13:24:13,937 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 13:24:18,656 WARN L180 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-11-18 13:24:18,775 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:24:18,776 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:18,786 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:18,787 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:18,791 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:18,791 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret21=0} Honda state: {ULTIMATE.start_check_#t~ret21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:18,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:18,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:18,810 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:18,810 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:18,826 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:18,826 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:18,830 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:18,830 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:18,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:18,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:18,849 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:18,849 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:18,864 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:18,864 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:18,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:24:18,867 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:18,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:24:18,884 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:19,422 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:24:19,422 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:24:31,748 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 13:24:31,772 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:24:31,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:24:31,772 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:24:31,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:24:31,772 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:24:31,772 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:31,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:24:31,772 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:24:31,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-18 13:24:31,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:24:31,772 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:24:31,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,927 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-18 13:24:31,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,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-18 13:24:31,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,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-18 13:24:31,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,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-18 13:24:31,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-18 13:24:31,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:31,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:32,190 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-18 13:24:32,360 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 13:24:37,115 WARN L180 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-11-18 13:24:37,202 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:24:37,202 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:24:37,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,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-18 13:24:37,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,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-18 13:24:37,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:37,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:37,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,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-18 13:24:37,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:37,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:37,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:24:37,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:24:37,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:24:37,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:24:37,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:24:37,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:24:37,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:24:37,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:24:37,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:24:37,247 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-11-18 13:24:37,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:24:37,265 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-18 13:24:37,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:24:37,377 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:24:37,573 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 13:24:37,573 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:24:37,574 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:24:37,574 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:24:37,574 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:24:37,574 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g1v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g1v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-18 13:24:37,575 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:24:37,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:37,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:37,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:24:37,921 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2018-11-18 13:24:37,921 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 822 states and 1150 transitions. cyclomatic complexity: 336 Second operand 16 states. [2018-11-18 13:24:38,575 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 822 states and 1150 transitions. cyclomatic complexity: 336. Second operand 16 states. Result 3756 states and 5169 transitions. Complement of second has 37 states. [2018-11-18 13:24:38,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-18 13:24:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 13:24:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1789 transitions. [2018-11-18 13:24:38,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1789 transitions. Stem has 61 letters. Loop has 54 letters. [2018-11-18 13:24:38,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:38,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1789 transitions. Stem has 115 letters. Loop has 54 letters. [2018-11-18 13:24:38,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:38,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1789 transitions. Stem has 61 letters. Loop has 108 letters. [2018-11-18 13:24:38,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:24:38,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3756 states and 5169 transitions. [2018-11-18 13:24:38,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 526 [2018-11-18 13:24:38,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3756 states to 2634 states and 3661 transitions. [2018-11-18 13:24:38,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2131 [2018-11-18 13:24:38,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2134 [2018-11-18 13:24:38,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2634 states and 3661 transitions. [2018-11-18 13:24:38,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:24:38,591 INFO L705 BuchiCegarLoop]: Abstraction has 2634 states and 3661 transitions. [2018-11-18 13:24:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states and 3661 transitions. [2018-11-18 13:24:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1482. [2018-11-18 13:24:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2018-11-18 13:24:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2080 transitions. [2018-11-18 13:24:38,608 INFO L728 BuchiCegarLoop]: Abstraction has 1482 states and 2080 transitions. [2018-11-18 13:24:38,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:24:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:24:38,609 INFO L87 Difference]: Start difference. First operand 1482 states and 2080 transitions. Second operand 4 states. [2018-11-18 13:24:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:24:38,643 INFO L93 Difference]: Finished difference Result 2807 states and 3944 transitions. [2018-11-18 13:24:38,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:24:38,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2807 states and 3944 transitions. [2018-11-18 13:24:38,652 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1052 [2018-11-18 13:24:38,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2807 states to 2805 states and 3942 transitions. [2018-11-18 13:24:38,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1922 [2018-11-18 13:24:38,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1922 [2018-11-18 13:24:38,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2805 states and 3942 transitions. [2018-11-18 13:24:38,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:24:38,658 INFO L705 BuchiCegarLoop]: Abstraction has 2805 states and 3942 transitions. [2018-11-18 13:24:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states and 3942 transitions. [2018-11-18 13:24:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 1482. [2018-11-18 13:24:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2018-11-18 13:24:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2079 transitions. [2018-11-18 13:24:38,673 INFO L728 BuchiCegarLoop]: Abstraction has 1482 states and 2079 transitions. [2018-11-18 13:24:38,673 INFO L608 BuchiCegarLoop]: Abstraction has 1482 states and 2079 transitions. [2018-11-18 13:24:38,673 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 13:24:38,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1482 states and 2079 transitions. [2018-11-18 13:24:38,675 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 526 [2018-11-18 13:24:38,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:24:38,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:24:38,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:24:38,676 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] [2018-11-18 13:24:38,677 INFO L794 eck$LassoCheckResult]: Stem: 56445#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 56188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56189#L116-3 assume true; 56612#L116-1 assume !!(add_history_type_~var~0 < 3); 56558#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56377#L171 assume 0 == read_history_bool_~history_id; 56378#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 56149#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 56359#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 56360#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 56613#L116-3 assume true; 56614#L116-1 assume !(add_history_type_~var~0 < 3); 56606#L116-4 add_history_type_#res := 1; 56396#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 56397#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56539#L116-8 assume true; 56634#L116-6 assume !!(add_history_type_~var~0 < 3); 56535#L117-2 assume !(0 == add_history_type_~history_id); 56536#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56615#L171-4 assume !(0 == read_history_bool_~history_id); 56462#L181-4 assume 1 == read_history_bool_~history_id; 56463#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 56345#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 56232#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 56233#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 56635#L116-8 assume true; 56636#L116-6 assume !(add_history_type_~var~0 < 3); 56629#L116-9 add_history_type_#res := 1; 56452#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 56389#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56390#L116-13 assume true; 56580#L116-11 assume !!(add_history_type_~var~0 < 3); 56530#L117-4 assume !(0 == add_history_type_~history_id); 56531#L123-4 assume !(1 == add_history_type_~history_id); 56659#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56639#L171-8 assume !(0 == read_history_bool_~history_id); 56487#L181-8 assume !(1 == read_history_bool_~history_id); 56248#L191-8 assume 2 == read_history_bool_~history_id; 56250#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 56362#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 56205#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 56206#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 56647#L116-13 assume true; 56700#L116-11 assume !(add_history_type_~var~0 < 3); 56577#L116-14 add_history_type_#res := 1; 56447#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 56162#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56163#L116-18 assume true; 56592#L116-16 assume !!(add_history_type_~var~0 < 3); 56517#L117-6 assume !(0 == add_history_type_~history_id); 56519#L123-6 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56630#L171-10 assume !(0 == read_history_bool_~history_id); 56481#L181-10 assume 1 == read_history_bool_~history_id; 56482#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 56255#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 56217#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 56195#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 56446#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 56394#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 56395#L558-3 assume true; 56882#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 57488#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 57487#L236-2 assume { :end_inline_write_history_bool } true; 57485#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 57484#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 56879#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 56381#L402 [2018-11-18 13:24:38,677 INFO L796 eck$LassoCheckResult]: Loop: 56381#L402 assume 2 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 56382#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 56391#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 56610#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 57574#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 57573#L226-2 assume !(0 == write_history_bool_~history_id); 57571#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 57546#L236-5 assume { :end_inline_write_history_bool } true; 57545#L421 assume 0 != ~gate2Failed~0 % 256; 56318#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 56258#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 56259#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 57548#L226-4 assume !(0 == write_history_bool_~history_id); 57547#L231-4 assume !(1 == write_history_bool_~history_id); 56456#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 56457#L236-8 assume { :end_inline_write_history_bool } true; 56491#L452 assume 0 != ~gate3Failed~0 % 256; 56597#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 57606#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 57605#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 57602#L486 assume ~VALUE1~0 == ~VALUE2~0; 57586#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 57382#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 57580#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 56605#L211-2 assume { :end_inline_write_history_int8 } true; 57576#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 57279#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 57277#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 57275#L171-12 assume 0 == read_history_bool_~history_id; 57274#L172-12 assume !(0 == read_history_bool_~historyIndex); 57273#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 57270#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 57269#L307 assume !(0 == check_~tmp___3~0 % 256); 56209#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 56210#L151-7 assume 3 == read_history_int8_~history_id; 56273#L152-7 assume !(0 == read_history_int8_~historyIndex); 56274#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 56277#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 56278#L346 assume !(check_~tmp___10~0 > -2); 56494#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 56495#L151-9 assume 3 == read_history_int8_~history_id; 56262#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 56264#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 56267#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 56343#L366-1 check_#res := 1; 56327#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 56328#L583-72 assume !(0 == assert_~arg % 256); 56537#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 56693#L558-3 assume true; 56685#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 56383#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 56384#L236-2 assume { :end_inline_write_history_bool } true; 56503#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 56465#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 56466#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 56381#L402 [2018-11-18 13:24:38,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1946790118, now seen corresponding path program 1 times [2018-11-18 13:24:38,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:38,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:38,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:24:38,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:24:38,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:24:38,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:24:38,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:38,723 INFO L82 PathProgramCache]: Analyzing trace with hash 101975071, now seen corresponding path program 1 times [2018-11-18 13:24:38,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:24:38,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:24:38,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:38,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:24:38,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:24:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:24:39,313 WARN L180 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 224 [2018-11-18 13:24:40,807 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 193 DAG size of output: 174 [2018-11-18 13:24:40,809 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:24:40,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:24:40,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:24:40,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:24:40,809 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:24:40,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:24:40,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:24:40,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:24:40,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-11-18 13:24:40,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:24:40,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:24:40,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,983 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-11-18 13:24:40,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:40,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:24:41,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2018-11-18 13:25:21,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:21,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:21,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,497 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 13:25:21,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,501 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 13:25:21,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:21,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:21,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:21,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:21,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:21,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:21,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:21,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:21,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:21,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:21,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:21,548 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:25:21,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:25:21,548 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:25:21,549 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:25:21,549 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:25:21,549 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:25:21,549 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-18 13:25:21,549 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:25:21,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:21,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:21,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:25:21,772 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:25:21,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1587 states and 2198 transitions. cyclomatic complexity: 619 Second operand 5 states. [2018-11-18 13:25:21,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1587 states and 2198 transitions. cyclomatic complexity: 619. Second operand 5 states. Result 3441 states and 4804 transitions. Complement of second has 6 states. [2018-11-18 13:25:21,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:25:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:25:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2018-11-18 13:25:21,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 620 transitions. Stem has 92 letters. Loop has 55 letters. [2018-11-18 13:25:21,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:25:21,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 620 transitions. Stem has 147 letters. Loop has 55 letters. [2018-11-18 13:25:21,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:25:21,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 620 transitions. Stem has 92 letters. Loop has 110 letters. [2018-11-18 13:25:21,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:25:21,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3441 states and 4804 transitions. [2018-11-18 13:25:21,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 517 [2018-11-18 13:25:21,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3441 states to 1579 states and 2158 transitions. [2018-11-18 13:25:21,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1124 [2018-11-18 13:25:21,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1124 [2018-11-18 13:25:21,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1579 states and 2158 transitions. [2018-11-18 13:25:21,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:21,808 INFO L705 BuchiCegarLoop]: Abstraction has 1579 states and 2158 transitions. [2018-11-18 13:25:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states and 2158 transitions. [2018-11-18 13:25:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2018-11-18 13:25:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-11-18 13:25:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2158 transitions. [2018-11-18 13:25:21,823 INFO L728 BuchiCegarLoop]: Abstraction has 1579 states and 2158 transitions. [2018-11-18 13:25:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:25:21,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:25:21,823 INFO L87 Difference]: Start difference. First operand 1579 states and 2158 transitions. Second operand 4 states. [2018-11-18 13:25:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:25:21,907 INFO L93 Difference]: Finished difference Result 2772 states and 3739 transitions. [2018-11-18 13:25:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:25:21,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2772 states and 3739 transitions. [2018-11-18 13:25:21,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 950 [2018-11-18 13:25:21,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2772 states to 2772 states and 3739 transitions. [2018-11-18 13:25:21,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1861 [2018-11-18 13:25:21,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1861 [2018-11-18 13:25:21,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2772 states and 3739 transitions. [2018-11-18 13:25:21,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:21,916 INFO L705 BuchiCegarLoop]: Abstraction has 2772 states and 3739 transitions. [2018-11-18 13:25:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states and 3739 transitions. [2018-11-18 13:25:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2180. [2018-11-18 13:25:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2018-11-18 13:25:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2948 transitions. [2018-11-18 13:25:21,931 INFO L728 BuchiCegarLoop]: Abstraction has 2180 states and 2948 transitions. [2018-11-18 13:25:21,931 INFO L608 BuchiCegarLoop]: Abstraction has 2180 states and 2948 transitions. [2018-11-18 13:25:21,931 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-18 13:25:21,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2180 states and 2948 transitions. [2018-11-18 13:25:21,934 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 683 [2018-11-18 13:25:21,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:25:21,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:25:21,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:25:21,935 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] [2018-11-18 13:25:21,936 INFO L794 eck$LassoCheckResult]: Stem: 89922#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 89684#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 89685#L116-3 assume true; 90070#L116-1 assume !!(add_history_type_~var~0 < 3); 90021#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 89856#L171 assume 0 == read_history_bool_~history_id; 89857#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 89651#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 89842#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 89843#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 90071#L116-3 assume true; 90072#L116-1 assume !(add_history_type_~var~0 < 3); 90062#L116-4 add_history_type_#res := 1; 89876#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 89877#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 90002#L116-8 assume true; 90090#L116-6 assume !!(add_history_type_~var~0 < 3); 89998#L117-2 assume !(0 == add_history_type_~history_id); 89999#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 90073#L171-4 assume !(0 == read_history_bool_~history_id); 89938#L181-4 assume 1 == read_history_bool_~history_id; 89939#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 89828#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 89722#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 89723#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 90091#L116-8 assume true; 90092#L116-6 assume !(add_history_type_~var~0 < 3); 90087#L116-9 add_history_type_#res := 1; 89930#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 89866#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 89867#L116-13 assume true; 90167#L116-11 assume !!(add_history_type_~var~0 < 3); 89993#L117-4 assume !(0 == add_history_type_~history_id); 89994#L123-4 assume !(1 == add_history_type_~history_id); 90117#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 90095#L171-8 assume !(0 == read_history_bool_~history_id); 89955#L181-8 assume !(1 == read_history_bool_~history_id); 89732#L191-8 assume 2 == read_history_bool_~history_id; 89734#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 89845#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 89696#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 89697#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 90038#L116-13 assume true; 90039#L116-11 assume !(add_history_type_~var~0 < 3); 90034#L116-14 add_history_type_#res := 1; 89925#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 89664#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 89665#L116-18 assume true; 90055#L116-16 assume !!(add_history_type_~var~0 < 3); 89981#L117-6 assume !(0 == add_history_type_~history_id); 89982#L123-6 assume !(1 == add_history_type_~history_id); 90106#L129-6 assume !(2 == add_history_type_~history_id); 89818#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 89819#L151-3 assume 3 == read_history_int8_~history_id; 89829#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 89831#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 89837#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 89814#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 89815#L116-18 assume true; 90050#L116-16 assume !(add_history_type_~var~0 < 3); 90049#L116-19 add_history_type_#res := 1; 89923#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 89924#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 89872#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 89873#L558-3 assume true; 90545#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 90537#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 90520#L236-2 assume { :end_inline_write_history_bool } true; 90519#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 90517#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 90518#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 91517#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 91516#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 91515#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91514#L226-2 assume !(0 == write_history_bool_~history_id); 91512#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 91509#L236-5 assume { :end_inline_write_history_bool } true; 91506#L421 assume 0 != ~gate2Failed~0 % 256; 91504#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 91502#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 91500#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91499#L226-4 assume !(0 == write_history_bool_~history_id); 91498#L231-4 assume !(1 == write_history_bool_~history_id); 91489#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 91488#L236-8 assume { :end_inline_write_history_bool } true; 91486#L452 assume 0 != ~gate3Failed~0 % 256; 91485#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 91484#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 91483#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 91480#L486 assume ~VALUE1~0 == ~VALUE2~0; 91477#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 91475#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 91472#L211 assume !(3 == write_history_int8_~history_id);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 91469#L583-40 [2018-11-18 13:25:21,936 INFO L796 eck$LassoCheckResult]: Loop: 91469#L583-40 assume !(0 == assert_~arg % 256); 91470#L578-20 assume { :end_inline_assert } true; 91466#L211-2 assume { :end_inline_write_history_int8 } true; 91465#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 91418#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 91416#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 91412#L171-12 assume 0 == read_history_bool_~history_id; 91410#L172-12 assume !(0 == read_history_bool_~historyIndex); 91409#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 91406#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 91313#L307 assume !(0 == check_~tmp___3~0 % 256); 90744#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 91242#L151-7 assume 3 == read_history_int8_~history_id; 91240#L152-7 assume !(0 == read_history_int8_~historyIndex); 91236#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 91235#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 91233#L346 assume !(check_~tmp___10~0 > -2); 89997#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 91230#L151-9 assume 3 == read_history_int8_~history_id; 91229#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 91227#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 91225#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 89826#L366-1 check_#res := 1; 89809#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 89810#L583-72 assume !(0 == assert_~arg % 256); 90000#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 90022#L558-3 assume true; 90153#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 90154#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 90735#L236-2 assume { :end_inline_write_history_bool } true; 90734#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 90407#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 90408#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 91752#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 91751#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 91750#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91749#L226-2 assume !(0 == write_history_bool_~history_id); 91746#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 91742#L236-5 assume { :end_inline_write_history_bool } true; 91739#L421 assume 0 != ~gate2Failed~0 % 256; 91740#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 91790#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 91788#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91787#L226-4 assume !(0 == write_history_bool_~history_id); 91786#L231-4 assume !(1 == write_history_bool_~history_id); 91785#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 91783#L236-8 assume { :end_inline_write_history_bool } true; 91781#L452 assume 0 != ~gate3Failed~0 % 256; 90015#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 89989#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 89990#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 91482#L486 assume !(~VALUE1~0 == ~VALUE2~0); 91478#L493 assume ~VALUE1~0 == ~VALUE3~0; 91474#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 91471#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 91468#L211 assume !(3 == write_history_int8_~history_id);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 91469#L583-40 [2018-11-18 13:25:21,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2060691287, now seen corresponding path program 1 times [2018-11-18 13:25:21,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:21,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:21,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:25:22,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:25:22,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:25:22,020 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:25:22,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1795312234, now seen corresponding path program 1 times [2018-11-18 13:25:22,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:22,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:22,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:25:22,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:25:22,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:25:22,037 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:25:22,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:25:22,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:25:22,037 INFO L87 Difference]: Start difference. First operand 2180 states and 2948 transitions. cyclomatic complexity: 776 Second operand 3 states. [2018-11-18 13:25:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:25:22,043 INFO L93 Difference]: Finished difference Result 2172 states and 2908 transitions. [2018-11-18 13:25:22,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:25:22,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2172 states and 2908 transitions. [2018-11-18 13:25:22,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 651 [2018-11-18 13:25:22,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2172 states to 2172 states and 2908 transitions. [2018-11-18 13:25:22,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1408 [2018-11-18 13:25:22,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1408 [2018-11-18 13:25:22,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2172 states and 2908 transitions. [2018-11-18 13:25:22,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:22,053 INFO L705 BuchiCegarLoop]: Abstraction has 2172 states and 2908 transitions. [2018-11-18 13:25:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states and 2908 transitions. [2018-11-18 13:25:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2148. [2018-11-18 13:25:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2018-11-18 13:25:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2884 transitions. [2018-11-18 13:25:22,069 INFO L728 BuchiCegarLoop]: Abstraction has 2148 states and 2884 transitions. [2018-11-18 13:25:22,069 INFO L608 BuchiCegarLoop]: Abstraction has 2148 states and 2884 transitions. [2018-11-18 13:25:22,069 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-18 13:25:22,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2148 states and 2884 transitions. [2018-11-18 13:25:22,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 651 [2018-11-18 13:25:22,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:25:22,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:25:22,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:25:22,075 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] [2018-11-18 13:25:22,075 INFO L794 eck$LassoCheckResult]: Stem: 94290#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 94043#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94044#L116-3 assume true; 94433#L116-1 assume !!(add_history_type_~var~0 < 3); 94387#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 94216#L171 assume 0 == read_history_bool_~history_id; 94217#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 94010#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 94202#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 94203#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 94434#L116-3 assume true; 94435#L116-1 assume !(add_history_type_~var~0 < 3); 94427#L116-4 add_history_type_#res := 1; 94235#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 94236#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94368#L116-8 assume true; 94454#L116-6 assume !!(add_history_type_~var~0 < 3); 94364#L117-2 assume !(0 == add_history_type_~history_id); 94365#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 94436#L171-4 assume !(0 == read_history_bool_~history_id); 94306#L181-4 assume 1 == read_history_bool_~history_id; 94307#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 94189#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 94081#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 94082#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 94455#L116-8 assume true; 94456#L116-6 assume !(add_history_type_~var~0 < 3); 94451#L116-9 add_history_type_#res := 1; 94298#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 94226#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94227#L116-13 assume true; 94543#L116-11 assume !!(add_history_type_~var~0 < 3); 94360#L117-4 assume !(0 == add_history_type_~history_id); 94362#L123-4 assume !(1 == add_history_type_~history_id); 94490#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 94461#L171-8 assume !(0 == read_history_bool_~history_id); 94322#L181-8 assume !(1 == read_history_bool_~history_id); 94091#L191-8 assume 2 == read_history_bool_~history_id; 94093#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 94205#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 94055#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 94056#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 94403#L116-13 assume true; 94404#L116-11 assume !(add_history_type_~var~0 < 3); 94400#L116-14 add_history_type_#res := 1; 94293#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 94023#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94024#L116-18 assume true; 94419#L116-16 assume !!(add_history_type_~var~0 < 3); 94348#L117-6 assume !(0 == add_history_type_~history_id); 94350#L123-6 assume !(1 == add_history_type_~history_id); 94477#L129-6 assume !(2 == add_history_type_~history_id); 94179#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94180#L151-3 assume 3 == read_history_int8_~history_id; 94190#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 94192#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 94198#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 94175#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 94176#L116-18 assume true; 94530#L116-16 assume !(add_history_type_~var~0 < 3); 94418#L116-19 add_history_type_#res := 1; 94291#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 94292#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 94232#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 94233#L558-3 assume true; 94849#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 94844#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 94843#L236-2 assume { :end_inline_write_history_bool } true; 94842#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 94840#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 94841#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 95513#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 95510#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 95507#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95505#L226-2 assume !(0 == write_history_bool_~history_id); 95500#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 95495#L236-5 assume { :end_inline_write_history_bool } true; 95492#L421 assume 0 != ~gate2Failed~0 % 256; 95491#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 95490#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 95489#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95488#L226-4 assume !(0 == write_history_bool_~history_id); 95487#L231-4 assume !(1 == write_history_bool_~history_id); 95480#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 95478#L236-8 assume { :end_inline_write_history_bool } true; 95475#L452 assume 0 != ~gate3Failed~0 % 256; 95472#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 95469#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 95468#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 95466#L486 assume ~VALUE1~0 == ~VALUE2~0; 95465#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 95398#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 95397#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 95395#L211-2 assume { :end_inline_write_history_int8 } true; 95341#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 95281#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 95278#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 95274#L171-12 assume 0 == read_history_bool_~history_id; 95270#L172-12 assume !(0 == read_history_bool_~historyIndex); 95268#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 95264#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 94961#L307 assume !(0 == check_~tmp___3~0 % 256); 94954#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94952#L151-7 assume 3 == read_history_int8_~history_id; 94950#L152-7 assume !(0 == read_history_int8_~historyIndex); 94947#L155-7 assume !(1 == read_history_int8_~historyIndex);read_history_int8_#res := ~votedValue_History_2~0; 94945#L163-7 [2018-11-18 13:25:22,265 INFO L796 eck$LassoCheckResult]: Loop: 94945#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 94943#L346 assume !(check_~tmp___10~0 > -2); 94912#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94941#L151-9 assume 3 == read_history_int8_~history_id; 94940#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 94937#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 94916#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 94910#L366-1 check_#res := 1; 94904#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 94902#L583-72 assume !(0 == assert_~arg % 256); 94903#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 94898#L558-3 assume true; 94899#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95386#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 95385#L236-2 assume { :end_inline_write_history_bool } true; 95384#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 95383#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 95382#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 95381#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 95380#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 95379#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95378#L226-2 assume !(0 == write_history_bool_~history_id); 95372#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 95368#L236-5 assume { :end_inline_write_history_bool } true; 95365#L421 assume 0 != ~gate2Failed~0 % 256; 95363#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 95361#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 95360#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95359#L226-4 assume !(0 == write_history_bool_~history_id); 95355#L231-4 assume !(1 == write_history_bool_~history_id); 95283#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 95279#L236-8 assume { :end_inline_write_history_bool } true; 95276#L452 assume 0 != ~gate3Failed~0 % 256; 95277#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 95459#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 95458#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 95455#L486 assume ~VALUE1~0 == ~VALUE2~0; 95444#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 95175#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 95430#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 95426#L211-2 assume { :end_inline_write_history_int8 } true; 95422#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 95089#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 95086#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 95083#L171-12 assume 0 == read_history_bool_~history_id; 95081#L172-12 assume !(0 == read_history_bool_~historyIndex); 95078#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 95073#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 95071#L307 assume !(0 == check_~tmp___3~0 % 256); 94908#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94989#L151-7 assume 3 == read_history_int8_~history_id; 94988#L152-7 assume !(0 == read_history_int8_~historyIndex); 94946#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 94945#L163-7 [2018-11-18 13:25:22,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1540104715, now seen corresponding path program 1 times [2018-11-18 13:25:22,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:22,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:22,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:22,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:25:22,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:25:22,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:25:22,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:25:22,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1700826180, now seen corresponding path program 4 times [2018-11-18 13:25:22,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:22,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:22,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:22,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:25:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:25:22,977 WARN L180 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 217 [2018-11-18 13:25:24,353 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 181 DAG size of output: 162 [2018-11-18 13:25:24,354 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:25:24,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:25:24,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:25:24,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:25:24,355 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:25:24,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:24,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:25:24,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:25:24,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration26_Loop [2018-11-18 13:25:24,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:25:24,355 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:25:24,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,530 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-11-18 13:25:24,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,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-18 13:25:24,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-18 13:25:24,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,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-18 13:25:24,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,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-18 13:25:24,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,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-18 13:25:24,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:24,801 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 13:25:27,008 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2018-11-18 13:25:27,069 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:25:27,069 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,084 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,084 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,104 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post13=0} Honda state: {ULTIMATE.start_check_#t~post13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,122 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,126 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,146 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,146 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,162 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,162 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,164 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,164 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post17=0} Honda state: {ULTIMATE.start_check_#t~post17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,182 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,182 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,199 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,199 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=0} Honda state: {ULTIMATE.start_check_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,220 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,222 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,222 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,240 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,260 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,260 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,262 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,262 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___6~0=0} Honda state: {ULTIMATE.start_check_~tmp___6~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,280 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,305 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,306 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,328 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_23=-1} Honda state: {v_rep#funAddr~voter.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___12~0=0} Honda state: {ULTIMATE.start_check_~tmp___12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 128 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,365 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret19=0} Honda state: {ULTIMATE.start_check_#t~ret19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,384 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,384 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite28=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite28=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,406 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,407 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___5~0=0} Honda state: {ULTIMATE.start_check_~tmp___5~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 131 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 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,443 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,443 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_23=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_23=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,452 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,452 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,472 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,473 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,474 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___2~2=0} Honda state: {ULTIMATE.start_check_~tmp___2~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 134 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,507 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,509 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,509 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,530 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,532 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,532 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_23=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 137 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 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,548 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,549 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,549 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 138 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 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,565 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 139 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 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,588 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,588 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 140 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 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,604 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,605 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 141 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 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,621 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,623 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,623 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret9=0} Honda state: {ULTIMATE.start_check_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 142 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 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,644 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,644 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_int8_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 143 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 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,665 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 144 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 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,680 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,680 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,682 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,682 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 145 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 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,704 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,705 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 146 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 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,723 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,723 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 147 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 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,744 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret12=0} Honda state: {ULTIMATE.start_check_#t~ret12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 148 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 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,762 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,762 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_23=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 149 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 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,784 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 150 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 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,813 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,813 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_~buf=-192, ~gate3Failed_History_1~0=-192, ~gate3Failed_History_2~0=-192, ~gate3Failed_History_0~0=-192, ~gate3Failed~0=-192, ULTIMATE.start_write_history_bool_#in~buf=-192} Honda state: {ULTIMATE.start_write_history_bool_~buf=-192, ~gate3Failed_History_1~0=-192, ~gate3Failed_History_2~0=-192, ~gate3Failed_History_0~0=-192, ~gate3Failed~0=-192, ULTIMATE.start_write_history_bool_#in~buf=-192} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 151 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 151 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,831 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,831 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,832 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 152 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 152 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,856 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,856 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_23=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 153 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 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,873 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret58=0} Honda state: {ULTIMATE.start_main_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 154 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 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,895 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,896 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 155 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 155 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:27,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:27,913 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 156 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 156 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:27,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:27,929 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 157 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 157 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:28,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:25:28,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:41,464 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 13:25:41,480 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:25:41,480 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:25:41,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:25:41,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:25:41,481 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:25:41,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:41,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:25:41,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:25:41,481 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration26_Loop [2018-11-18 13:25:41,481 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:25:41,481 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:25:41,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,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-18 13:25:41,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,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-18 13:25:41,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,720 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-11-18 13:25:41,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-18 13:25:41,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-18 13:25:41,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,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-18 13:25:41,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:41,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:42,106 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 13:25:44,366 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2018-11-18 13:25:44,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:25:44,391 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:25:44,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:44,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:44,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:44,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:44,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,425 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:44,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:44,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:44,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:44,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:44,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:44,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:25:44,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:25:44,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,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-18 13:25:44,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:25:44,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:25:44,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:25:44,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:25:44,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:25:44,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:25:44,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:25:44,823 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-18 13:25:44,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:25:44,827 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 13:25:44,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:25:44,858 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:25:44,893 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:25:44,893 INFO L444 ModelExtractionUtils]: 16 out of 21 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 13:25:44,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:25:44,934 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:25:44,934 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:25:44,934 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_read_history_int8_#res, ~nomsg~0, ~g1v_old~0) = -1*ULTIMATE.start_read_history_int8_#res + 1*~nomsg~0 - 1*~g1v_old~0 Supporting invariants [] [2018-11-18 13:25:44,934 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:25:44,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:44,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:45,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:25:45,128 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-11-18 13:25:45,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2148 states and 2884 transitions. cyclomatic complexity: 744 Second operand 14 states. [2018-11-18 13:25:45,829 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2148 states and 2884 transitions. cyclomatic complexity: 744. Second operand 14 states. Result 9799 states and 13057 transitions. Complement of second has 37 states. [2018-11-18 13:25:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-18 13:25:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 13:25:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1377 transitions. [2018-11-18 13:25:45,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1377 transitions. Stem has 106 letters. Loop has 53 letters. [2018-11-18 13:25:45,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:25:45,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1377 transitions. Stem has 159 letters. Loop has 53 letters. [2018-11-18 13:25:45,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:25:45,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1377 transitions. Stem has 106 letters. Loop has 106 letters. [2018-11-18 13:25:45,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:25:45,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9799 states and 13057 transitions. [2018-11-18 13:25:45,847 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1302 [2018-11-18 13:25:45,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9799 states to 7244 states and 9719 transitions. [2018-11-18 13:25:45,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5004 [2018-11-18 13:25:45,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5164 [2018-11-18 13:25:45,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7244 states and 9719 transitions. [2018-11-18 13:25:45,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:45,857 INFO L705 BuchiCegarLoop]: Abstraction has 7244 states and 9719 transitions. [2018-11-18 13:25:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states and 9719 transitions. [2018-11-18 13:25:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 4667. [2018-11-18 13:25:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4667 states. [2018-11-18 13:25:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 6251 transitions. [2018-11-18 13:25:45,902 INFO L728 BuchiCegarLoop]: Abstraction has 4667 states and 6251 transitions. [2018-11-18 13:25:45,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:25:45,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:25:45,902 INFO L87 Difference]: Start difference. First operand 4667 states and 6251 transitions. Second operand 3 states. [2018-11-18 13:25:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:25:46,014 INFO L93 Difference]: Finished difference Result 3667 states and 4888 transitions. [2018-11-18 13:25:46,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:25:46,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3667 states and 4888 transitions. [2018-11-18 13:25:46,022 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2018-11-18 13:25:46,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3667 states to 3667 states and 4888 transitions. [2018-11-18 13:25:46,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2452 [2018-11-18 13:25:46,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2452 [2018-11-18 13:25:46,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3667 states and 4888 transitions. [2018-11-18 13:25:46,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:46,029 INFO L705 BuchiCegarLoop]: Abstraction has 3667 states and 4888 transitions. [2018-11-18 13:25:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states and 4888 transitions. [2018-11-18 13:25:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 2148. [2018-11-18 13:25:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2018-11-18 13:25:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2880 transitions. [2018-11-18 13:25:46,046 INFO L728 BuchiCegarLoop]: Abstraction has 2148 states and 2880 transitions. [2018-11-18 13:25:46,046 INFO L608 BuchiCegarLoop]: Abstraction has 2148 states and 2880 transitions. [2018-11-18 13:25:46,046 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-18 13:25:46,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2148 states and 2880 transitions. [2018-11-18 13:25:46,049 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 651 [2018-11-18 13:25:46,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:25:46,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:25:46,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:25:46,051 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] [2018-11-18 13:25:46,051 INFO L794 eck$LassoCheckResult]: Stem: 115124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 114891#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 114892#L116-3 assume true; 115262#L116-1 assume !!(add_history_type_~var~0 < 3); 115222#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115057#L171 assume 0 == read_history_bool_~history_id; 115058#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 114858#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 115043#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 115044#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 115263#L116-3 assume true; 115264#L116-1 assume !(add_history_type_~var~0 < 3); 115257#L116-4 add_history_type_#res := 1; 115076#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 115077#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 115206#L116-8 assume true; 115278#L116-6 assume !!(add_history_type_~var~0 < 3); 115201#L117-2 assume !(0 == add_history_type_~history_id); 115202#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115265#L171-4 assume !(0 == read_history_bool_~history_id); 115140#L181-4 assume 1 == read_history_bool_~history_id; 115141#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 115029#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 114927#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 114928#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 115279#L116-8 assume true; 115280#L116-6 assume !(add_history_type_~var~0 < 3); 115275#L116-9 add_history_type_#res := 1; 115132#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 115067#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 115068#L116-13 assume true; 115237#L116-11 assume !!(add_history_type_~var~0 < 3); 115196#L117-4 assume !(0 == add_history_type_~history_id); 115197#L123-4 assume !(1 == add_history_type_~history_id); 115312#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115283#L171-8 assume !(0 == read_history_bool_~history_id); 115157#L181-8 assume !(1 == read_history_bool_~history_id); 114937#L191-8 assume 2 == read_history_bool_~history_id; 114939#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 115046#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 114903#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 114904#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 115290#L116-13 assume true; 115243#L116-11 assume !(add_history_type_~var~0 < 3); 115235#L116-14 add_history_type_#res := 1; 115127#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 114871#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 114872#L116-18 assume true; 115353#L116-16 assume !!(add_history_type_~var~0 < 3); 115184#L117-6 assume !(0 == add_history_type_~history_id); 115185#L123-6 assume !(1 == add_history_type_~history_id); 115297#L129-6 assume !(2 == add_history_type_~history_id); 115021#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115022#L151-3 assume 3 == read_history_int8_~history_id; 115030#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 115032#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 115038#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 115017#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 115018#L116-18 assume true; 115251#L116-16 assume !(add_history_type_~var~0 < 3); 115250#L116-19 add_history_type_#res := 1; 115125#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 115126#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 115073#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 115074#L558-3 assume true; 115779#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 116101#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 116099#L236-2 assume { :end_inline_write_history_bool } true; 116097#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 116094#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 115069#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 115070#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 115260#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 115188#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 115053#L226-2 assume !(0 == write_history_bool_~history_id); 115054#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 115082#L236-5 assume { :end_inline_write_history_bool } true; 115148#L421 assume 0 != ~gate2Failed~0 % 256; 115003#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 114943#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 114944#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 115134#L226-4 assume !(0 == write_history_bool_~history_id); 115128#L231-4 assume !(1 == write_history_bool_~history_id); 115129#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 115136#L236-8 assume { :end_inline_write_history_bool } true; 115161#L452 assume 0 != ~gate3Failed~0 % 256; 115217#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 115192#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 115193#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 115286#L486 assume ~VALUE1~0 == ~VALUE2~0; 117001#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 116999#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 115352#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 115345#L211-2 assume { :end_inline_write_history_int8 } true; 115319#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 115320#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 116796#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 116792#L171-12 assume 0 == read_history_bool_~history_id; 116790#L172-12 assume !(0 == read_history_bool_~historyIndex); 116789#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 116785#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 114897#L307 assume !(0 == check_~tmp___3~0 % 256); 114898#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 114907#L151-7 assume 3 == read_history_int8_~history_id; 114959#L152-7 assume !(0 == read_history_int8_~historyIndex); 114960#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 114963#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 114964#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115181#L151-8 [2018-11-18 13:25:46,051 INFO L796 eck$LassoCheckResult]: Loop: 115181#L151-8 assume 3 == read_history_int8_~history_id; 114955#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 114956#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 114958#L348 assume check_~tmp___6~0 == ~nomsg~0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115227#L171-15 assume 0 == read_history_bool_~history_id; 115236#L172-15 assume !(0 == read_history_bool_~historyIndex); 115348#L175-15 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 115899#L203-15 check_#t~ret20 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___7~0 := check_#t~ret20;havoc check_#t~ret20; 115867#L350 assume !(0 != check_~tmp___7~0 % 256);check_#res := 0; 115866#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 115865#L583-72 assume !(0 == assert_~arg % 256); 115859#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 115856#L558-3 assume true; 115778#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 115772#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 115770#L236-2 assume { :end_inline_write_history_bool } true; 115754#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 115714#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 115715#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 116924#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 116923#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 116922#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 116921#L226-2 assume !(0 == write_history_bool_~history_id); 116451#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 116448#L236-5 assume { :end_inline_write_history_bool } true; 116446#L421 assume 0 != ~gate2Failed~0 % 256; 116447#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 116458#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 116456#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 116416#L226-4 assume !(0 == write_history_bool_~history_id); 116402#L231-4 assume !(1 == write_history_bool_~history_id); 116372#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 116336#L236-8 assume { :end_inline_write_history_bool } true; 116323#L452 assume 0 != ~gate3Failed~0 % 256; 116324#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 116984#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 116983#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 116981#L486 assume ~VALUE1~0 == ~VALUE2~0; 116980#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 114887#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 116979#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 116978#L211-2 assume { :end_inline_write_history_int8 } true; 116977#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 116260#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 116257#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 116254#L171-12 assume 0 == read_history_bool_~history_id; 116252#L172-12 assume !(0 == read_history_bool_~historyIndex); 116250#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 116247#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 116246#L307 assume !(0 == check_~tmp___3~0 % 256); 115931#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115930#L151-7 assume 3 == read_history_int8_~history_id; 115929#L152-7 assume !(0 == read_history_int8_~historyIndex); 115928#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 115927#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 115926#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115181#L151-8 [2018-11-18 13:25:46,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:46,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034420, now seen corresponding path program 1 times [2018-11-18 13:25:46,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:46,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:46,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:25:46,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:46,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:25:46,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:25:46,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:46,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:46,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:25:46,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-11-18 13:25:46,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:25:46,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1488773560, now seen corresponding path program 1 times [2018-11-18 13:25:46,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:46,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:46,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:25:46,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:25:46,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:25:46,376 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:25:46,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:25:46,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:25:46,377 INFO L87 Difference]: Start difference. First operand 2148 states and 2880 transitions. cyclomatic complexity: 740 Second operand 4 states. [2018-11-18 13:25:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:25:46,402 INFO L93 Difference]: Finished difference Result 2044 states and 2666 transitions. [2018-11-18 13:25:46,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:25:46,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2044 states and 2666 transitions. [2018-11-18 13:25:46,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 583 [2018-11-18 13:25:46,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2044 states to 1932 states and 2540 transitions. [2018-11-18 13:25:46,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1260 [2018-11-18 13:25:46,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1260 [2018-11-18 13:25:46,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1932 states and 2540 transitions. [2018-11-18 13:25:46,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:46,407 INFO L705 BuchiCegarLoop]: Abstraction has 1932 states and 2540 transitions. [2018-11-18 13:25:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states and 2540 transitions. [2018-11-18 13:25:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1932. [2018-11-18 13:25:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2018-11-18 13:25:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2540 transitions. [2018-11-18 13:25:46,414 INFO L728 BuchiCegarLoop]: Abstraction has 1932 states and 2540 transitions. [2018-11-18 13:25:46,414 INFO L608 BuchiCegarLoop]: Abstraction has 1932 states and 2540 transitions. [2018-11-18 13:25:46,414 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-18 13:25:46,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1932 states and 2540 transitions. [2018-11-18 13:25:46,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 583 [2018-11-18 13:25:46,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:25:46,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:25:46,417 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:25:46,417 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] [2018-11-18 13:25:46,417 INFO L794 eck$LassoCheckResult]: Stem: 119635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 119414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119415#L116-3 assume true; 119757#L116-1 assume !!(add_history_type_~var~0 < 3); 119726#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 119573#L171 assume 0 == read_history_bool_~history_id; 119574#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 119389#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 119563#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 119564#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 119758#L116-3 assume true; 119759#L116-1 assume !(add_history_type_~var~0 < 3); 119754#L116-4 add_history_type_#res := 1; 119590#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 119591#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119711#L116-8 assume true; 119767#L116-6 assume !!(add_history_type_~var~0 < 3); 119707#L117-2 assume !(0 == add_history_type_~history_id); 119708#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 119760#L171-4 assume !(0 == read_history_bool_~history_id); 119649#L181-4 assume 1 == read_history_bool_~history_id; 119650#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 119550#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 119449#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 119450#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 119768#L116-8 assume true; 119769#L116-6 assume !(add_history_type_~var~0 < 3); 119766#L116-9 add_history_type_#res := 1; 119643#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 119582#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119583#L116-13 assume true; 119843#L116-11 assume !!(add_history_type_~var~0 < 3); 119701#L117-4 assume !(0 == add_history_type_~history_id); 119702#L123-4 assume !(1 == add_history_type_~history_id); 119794#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 119770#L171-8 assume !(0 == read_history_bool_~history_id); 119662#L181-8 assume !(1 == read_history_bool_~history_id); 119459#L191-8 assume 2 == read_history_bool_~history_id; 119460#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 119664#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 119429#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 119430#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 119740#L116-13 assume true; 119741#L116-11 assume !(add_history_type_~var~0 < 3); 119736#L116-14 add_history_type_#res := 1; 119638#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 119398#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119399#L116-18 assume true; 119749#L116-16 assume !!(add_history_type_~var~0 < 3); 119689#L117-6 assume !(0 == add_history_type_~history_id); 119690#L123-6 assume !(1 == add_history_type_~history_id); 119783#L129-6 assume !(2 == add_history_type_~history_id); 119541#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 119542#L151-3 assume 3 == read_history_int8_~history_id; 119551#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 119553#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 119559#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 119537#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 119538#L116-18 assume true; 119751#L116-16 assume !(add_history_type_~var~0 < 3); 119748#L116-19 add_history_type_#res := 1; 119636#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 119637#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 119588#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 119589#L558-3 assume true; 119821#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 119822#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 120285#L236-2 assume { :end_inline_write_history_bool } true; 120284#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 120282#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 120283#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 121054#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 121051#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 121048#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121044#L226-2 assume !(0 == write_history_bool_~history_id); 121041#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 121036#L236-5 assume { :end_inline_write_history_bool } true; 121032#L421 assume 0 != ~gate2Failed~0 % 256; 121033#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 121038#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 121035#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121031#L226-4 assume !(0 == write_history_bool_~history_id); 121026#L231-4 assume !(1 == write_history_bool_~history_id); 121024#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 121020#L236-8 assume { :end_inline_write_history_bool } true; 121016#L452 assume 0 != ~gate3Failed~0 % 256; 121013#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 121009#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 121005#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 120999#L486 assume ~VALUE1~0 == ~VALUE2~0; 120977#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 120970#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 120964#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 120956#L211-2 assume { :end_inline_write_history_int8 } true; 120949#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 120852#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 120846#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 120840#L171-12 assume 0 == read_history_bool_~history_id; 120841#L172-12 assume !(0 == read_history_bool_~historyIndex); 120819#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 120809#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 120424#L307 assume !(0 == check_~tmp___3~0 % 256); 120375#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120366#L151-7 assume 3 == read_history_int8_~history_id; 120364#L152-7 assume !(0 == read_history_int8_~historyIndex); 120362#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 120360#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 120358#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120352#L151-8 [2018-11-18 13:25:46,720 INFO L796 eck$LassoCheckResult]: Loop: 120352#L151-8 assume 3 == read_history_int8_~history_id; 120410#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 120409#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 120351#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 120350#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120349#L151-9 assume 3 == read_history_int8_~history_id; 120291#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 119723#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 120288#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 119548#L366-1 check_#res := 1; 120342#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 120341#L583-72 assume !(0 == assert_~arg % 256); 120340#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 120339#L558-3 assume true; 120338#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 119576#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 119577#L236-2 assume { :end_inline_write_history_bool } true; 119678#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 120233#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 120234#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 121182#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 121180#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 121178#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121175#L226-2 assume !(0 == write_history_bool_~history_id); 121172#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 121170#L236-5 assume { :end_inline_write_history_bool } true; 121167#L421 assume 0 != ~gate2Failed~0 % 256; 121165#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 121163#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 121161#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121159#L226-4 assume !(0 == write_history_bool_~history_id); 121157#L231-4 assume !(1 == write_history_bool_~history_id); 121156#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 121155#L236-8 assume { :end_inline_write_history_bool } true; 121153#L452 assume 0 != ~gate3Failed~0 % 256; 121154#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 121273#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 121271#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 121268#L486 assume ~VALUE1~0 == ~VALUE2~0; 121269#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 119410#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 121290#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 121288#L211-2 assume { :end_inline_write_history_int8 } true; 121285#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 121210#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 121208#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 121204#L171-12 assume 0 == read_history_bool_~history_id; 121202#L172-12 assume !(0 == read_history_bool_~historyIndex); 121199#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 121193#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 120440#L307 assume !(0 == check_~tmp___3~0 % 256); 120435#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120432#L151-7 assume 3 == read_history_int8_~history_id; 120426#L152-7 assume !(0 == read_history_int8_~historyIndex); 119724#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 119725#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 120295#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120352#L151-8 [2018-11-18 13:25:46,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:46,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034420, now seen corresponding path program 2 times [2018-11-18 13:25:46,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:46,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:46,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:46,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:46,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:25:46,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:25:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:25:46,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:25:46,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:25:46,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:46,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:25:46,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-11-18 13:25:46,881 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:25:46,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1049986076, now seen corresponding path program 1 times [2018-11-18 13:25:46,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:46,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:46,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:25:46,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:25:46,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:25:46,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:25:46,905 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:25:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 13:25:46,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:25:46,905 INFO L87 Difference]: Start difference. First operand 1932 states and 2540 transitions. cyclomatic complexity: 616 Second operand 7 states. [2018-11-18 13:25:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:25:47,189 INFO L93 Difference]: Finished difference Result 7115 states and 9439 transitions. [2018-11-18 13:25:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 13:25:47,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7115 states and 9439 transitions. [2018-11-18 13:25:47,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3209 [2018-11-18 13:25:47,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7115 states to 7115 states and 9439 transitions. [2018-11-18 13:25:47,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5174 [2018-11-18 13:25:47,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5174 [2018-11-18 13:25:47,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7115 states and 9439 transitions. [2018-11-18 13:25:47,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:47,209 INFO L705 BuchiCegarLoop]: Abstraction has 7115 states and 9439 transitions. [2018-11-18 13:25:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states and 9439 transitions. [2018-11-18 13:25:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 1936. [2018-11-18 13:25:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-11-18 13:25:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2546 transitions. [2018-11-18 13:25:47,234 INFO L728 BuchiCegarLoop]: Abstraction has 1936 states and 2546 transitions. [2018-11-18 13:25:47,234 INFO L608 BuchiCegarLoop]: Abstraction has 1936 states and 2546 transitions. [2018-11-18 13:25:47,234 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-18 13:25:47,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1936 states and 2546 transitions. [2018-11-18 13:25:47,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 597 [2018-11-18 13:25:47,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:25:47,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:25:47,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:25:47,238 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] [2018-11-18 13:25:47,238 INFO L794 eck$LassoCheckResult]: Stem: 129055#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 128819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 128820#L116-3 assume true; 129191#L116-1 assume !!(add_history_type_~var~0 < 3); 129152#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 128984#L171 assume 0 == read_history_bool_~history_id; 128985#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 128794#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 128974#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 128975#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129192#L116-3 assume true; 129193#L116-1 assume !(add_history_type_~var~0 < 3); 129188#L116-4 add_history_type_#res := 1; 129003#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 129004#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 129135#L116-8 assume true; 129200#L116-6 assume !!(add_history_type_~var~0 < 3); 129131#L117-2 assume !(0 == add_history_type_~history_id); 129132#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 129194#L171-4 assume !(0 == read_history_bool_~history_id); 129070#L181-4 assume 1 == read_history_bool_~history_id; 129071#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 128961#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 128855#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 128856#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129201#L116-8 assume true; 129202#L116-6 assume !(add_history_type_~var~0 < 3); 129199#L116-9 add_history_type_#res := 1; 129063#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 128993#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 128994#L116-13 assume true; 129296#L116-11 assume !!(add_history_type_~var~0 < 3); 129126#L117-4 assume !(0 == add_history_type_~history_id); 129128#L123-4 assume !(1 == add_history_type_~history_id); 129239#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 129203#L171-8 assume !(0 == read_history_bool_~history_id); 129086#L181-8 assume !(1 == read_history_bool_~history_id); 128865#L191-8 assume 2 == read_history_bool_~history_id; 128866#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 129088#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 128831#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 128832#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129172#L116-13 assume true; 129173#L116-11 assume !(add_history_type_~var~0 < 3); 129166#L116-14 add_history_type_#res := 1; 129058#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 128803#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 128804#L116-18 assume true; 129287#L116-16 assume !!(add_history_type_~var~0 < 3); 129114#L117-6 assume !(0 == add_history_type_~history_id); 129116#L123-6 assume !(1 == add_history_type_~history_id); 129224#L129-6 assume !(2 == add_history_type_~history_id); 128951#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 128952#L151-3 assume 3 == read_history_int8_~history_id; 128962#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 128964#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 128970#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 128947#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 128948#L116-18 assume true; 129182#L116-16 assume !(add_history_type_~var~0 < 3); 129181#L116-19 add_history_type_#res := 1; 129056#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 129057#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 128999#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 129000#L558-3 assume true; 129592#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 129780#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 129779#L236-2 assume { :end_inline_write_history_bool } true; 129778#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 129776#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 129777#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 130345#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 130344#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 130343#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130342#L226-2 assume !(0 == write_history_bool_~history_id); 130341#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 130339#L236-5 assume { :end_inline_write_history_bool } true; 130337#L421 assume 0 != ~gate2Failed~0 % 256; 130338#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 130336#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 130332#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130330#L226-4 assume !(0 == write_history_bool_~history_id); 130328#L231-4 assume !(1 == write_history_bool_~history_id); 130326#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 130324#L236-8 assume { :end_inline_write_history_bool } true; 130319#L452 assume 0 != ~gate3Failed~0 % 256; 130316#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 130313#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 130310#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 130305#L486 assume ~VALUE1~0 == ~VALUE2~0; 130301#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 130295#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 130149#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 130137#L211-2 assume { :end_inline_write_history_int8 } true; 130132#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 130125#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 130119#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 130117#L171-12 assume 0 == read_history_bool_~history_id; 130106#L172-12 assume !(0 == read_history_bool_~historyIndex); 130095#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 130086#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 130078#L307 assume !(0 == check_~tmp___3~0 % 256); 130069#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 129221#L151-7 assume 3 == read_history_int8_~history_id; 129222#L152-7 assume !(0 == read_history_int8_~historyIndex); 129150#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 129151#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 129111#L346 assume !(check_~tmp___10~0 > -2); 129112#L346-1 [2018-11-18 13:25:47,238 INFO L796 eck$LassoCheckResult]: Loop: 129112#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 129256#L151-9 assume 3 == read_history_int8_~history_id; 129257#L152-9 assume !(0 == read_history_int8_~historyIndex); 128874#L155-9 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 128875#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 129904#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 128959#L366-1 check_#res := 1; 128942#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 128943#L583-72 assume !(0 == assert_~arg % 256); 129133#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 129153#L558-3 assume true; 129889#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 129886#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 129885#L236-2 assume { :end_inline_write_history_bool } true; 129884#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 129880#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 129881#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 130548#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 130545#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 130541#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130539#L226-2 assume !(0 == write_history_bool_~history_id); 130537#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 130534#L236-5 assume { :end_inline_write_history_bool } true; 130531#L421 assume 0 != ~gate2Failed~0 % 256; 130532#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 130645#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 130640#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130634#L226-4 assume !(0 == write_history_bool_~history_id); 130632#L231-4 assume !(1 == write_history_bool_~history_id); 130631#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 130630#L236-8 assume { :end_inline_write_history_bool } true; 130629#L452 assume 0 != ~gate3Failed~0 % 256; 130626#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 130623#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 130621#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 130618#L486 assume ~VALUE1~0 == ~VALUE2~0; 130614#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 130205#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 130442#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 129878#L211-2 assume { :end_inline_write_history_int8 } true; 129877#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 129807#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 129805#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 129803#L171-12 assume 0 == read_history_bool_~history_id; 129801#L172-12 assume !(0 == read_history_bool_~historyIndex); 129799#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 129798#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 129793#L307 assume !(0 == check_~tmp___3~0 % 256); 128826#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 128835#L151-7 assume 3 == read_history_int8_~history_id; 128886#L152-7 assume !(0 == read_history_int8_~historyIndex); 128887#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 128890#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 128891#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 129113#L151-8 assume 3 == read_history_int8_~history_id; 128881#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 128882#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 129156#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 129112#L346-1 [2018-11-18 13:25:47,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:47,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034201, now seen corresponding path program 1 times [2018-11-18 13:25:47,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:47,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:47,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:25:47,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:25:47,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:47,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:47,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:25:47,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 13:25:47,394 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:25:47,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1644533277, now seen corresponding path program 1 times [2018-11-18 13:25:47,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:47,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:25:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:25:47,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:25:47,401 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 13:25:47,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:25:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:25:47,401 INFO L87 Difference]: Start difference. First operand 1936 states and 2546 transitions. cyclomatic complexity: 618 Second operand 3 states. [2018-11-18 13:25:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:25:47,419 INFO L93 Difference]: Finished difference Result 1894 states and 2404 transitions. [2018-11-18 13:25:47,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:25:47,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1894 states and 2404 transitions. [2018-11-18 13:25:47,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 573 [2018-11-18 13:25:47,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1894 states to 1894 states and 2404 transitions. [2018-11-18 13:25:47,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1232 [2018-11-18 13:25:47,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1232 [2018-11-18 13:25:47,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1894 states and 2404 transitions. [2018-11-18 13:25:47,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:25:47,426 INFO L705 BuchiCegarLoop]: Abstraction has 1894 states and 2404 transitions. [2018-11-18 13:25:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states and 2404 transitions. [2018-11-18 13:25:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1884. [2018-11-18 13:25:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2018-11-18 13:25:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2394 transitions. [2018-11-18 13:25:47,436 INFO L728 BuchiCegarLoop]: Abstraction has 1884 states and 2394 transitions. [2018-11-18 13:25:47,437 INFO L608 BuchiCegarLoop]: Abstraction has 1884 states and 2394 transitions. [2018-11-18 13:25:47,437 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-18 13:25:47,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1884 states and 2394 transitions. [2018-11-18 13:25:47,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 571 [2018-11-18 13:25:47,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:25:47,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:25:47,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:25:47,440 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] [2018-11-18 13:25:47,441 INFO L794 eck$LassoCheckResult]: Stem: 133190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 132979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 132980#L116-3 assume true; 133320#L116-1 assume !!(add_history_type_~var~0 < 3); 133285#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 133124#L171 assume 0 == read_history_bool_~history_id; 133125#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 132956#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 133114#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 133115#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 133321#L116-3 assume true; 133322#L116-1 assume !(add_history_type_~var~0 < 3); 133317#L116-4 add_history_type_#res := 1; 133141#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 133142#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 133267#L116-8 assume true; 133332#L116-6 assume !!(add_history_type_~var~0 < 3); 133262#L117-2 assume !(0 == add_history_type_~history_id); 133263#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 133323#L171-4 assume !(0 == read_history_bool_~history_id); 133204#L181-4 assume 1 == read_history_bool_~history_id; 133205#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 133103#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 133014#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 133015#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 133333#L116-8 assume true; 133334#L116-6 assume !(add_history_type_~var~0 < 3); 133331#L116-9 add_history_type_#res := 1; 133198#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 133133#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 133134#L116-13 assume true; 133415#L116-11 assume !!(add_history_type_~var~0 < 3); 133257#L117-4 assume !(0 == add_history_type_~history_id); 133259#L123-4 assume !(1 == add_history_type_~history_id); 133359#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 133335#L171-8 assume !(0 == read_history_bool_~history_id); 133218#L181-8 assume !(1 == read_history_bool_~history_id); 133024#L191-8 assume 2 == read_history_bool_~history_id; 133025#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 133220#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 132991#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 132992#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 133301#L116-13 assume true; 133302#L116-11 assume !(add_history_type_~var~0 < 3); 133296#L116-14 add_history_type_#res := 1; 133193#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 132963#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 132964#L116-18 assume true; 133407#L116-16 assume !!(add_history_type_~var~0 < 3); 133245#L117-6 assume !(0 == add_history_type_~history_id); 133247#L123-6 assume !(1 == add_history_type_~history_id); 133350#L129-6 assume !(2 == add_history_type_~history_id); 133094#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133095#L151-3 assume 3 == read_history_int8_~history_id; 133104#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 133105#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 133110#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 133090#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 133091#L116-18 assume true; 133311#L116-16 assume !(add_history_type_~var~0 < 3); 133310#L116-19 add_history_type_#res := 1; 133191#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 133192#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 133139#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 133140#L558-3 assume true; 133772#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 133766#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 133764#L236-2 assume { :end_inline_write_history_bool } true; 133762#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 133752#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 133753#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 134371#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 134370#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 134369#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134368#L226-2 assume !(0 == write_history_bool_~history_id); 134366#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 134364#L236-5 assume { :end_inline_write_history_bool } true; 134362#L421 assume 0 != ~gate2Failed~0 % 256; 134363#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 134518#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 134515#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134514#L226-4 assume !(0 == write_history_bool_~history_id); 134510#L231-4 assume !(1 == write_history_bool_~history_id); 134508#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 134506#L236-8 assume { :end_inline_write_history_bool } true; 134504#L452 assume 0 != ~gate3Failed~0 % 256; 134502#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 134499#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 134497#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 134494#L486 assume ~VALUE1~0 == ~VALUE2~0; 134492#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 134489#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 134487#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 134484#L211-2 assume { :end_inline_write_history_int8 } true; 134483#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 134259#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 134257#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 134255#L171-12 assume 0 == read_history_bool_~history_id; 134253#L172-12 assume !(0 == read_history_bool_~historyIndex); 134251#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 134249#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 134248#L307 assume !(0 == check_~tmp___3~0 % 256); 132986#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 132995#L151-7 assume 3 == read_history_int8_~history_id; 133041#L152-7 assume !(0 == read_history_int8_~historyIndex); 133042#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 133899#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 133895#L346 assume !(check_~tmp___10~0 > -2); 133288#L346-1 [2018-11-18 13:25:47,441 INFO L796 eck$LassoCheckResult]: Loop: 133288#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133910#L151-9 assume 3 == read_history_int8_~history_id; 133909#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 133908#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 133907#L366 assume check_~tmp___11~0 != ~nomsg~0;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133903#L151-10 assume 3 == read_history_int8_~history_id; 133906#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 133088#L163-10 check_#t~ret24 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 133089#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 133352#L366-1 check_#res := 1; 133353#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 134240#L583-72 assume !(0 == assert_~arg % 256); 134239#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 134238#L558-3 assume true; 134236#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134233#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 134232#L236-2 assume { :end_inline_write_history_bool } true; 134231#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 134230#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 134229#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 134228#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 134227#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 134226#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134224#L226-2 assume !(0 == write_history_bool_~history_id); 134222#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 134219#L236-5 assume { :end_inline_write_history_bool } true; 134216#L421 assume 0 != ~gate2Failed~0 % 256; 134217#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 134786#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 134785#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134626#L226-4 assume !(0 == write_history_bool_~history_id); 134625#L231-4 assume !(1 == write_history_bool_~history_id); 134624#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 134623#L236-8 assume { :end_inline_write_history_bool } true; 134621#L452 assume 0 != ~gate3Failed~0 % 256; 134619#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 134617#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 134616#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 134614#L486 assume ~VALUE1~0 == ~VALUE2~0; 134610#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 134606#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 134604#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 134602#L211-2 assume { :end_inline_write_history_int8 } true; 134600#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 134119#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 134116#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 134112#L171-12 assume 0 == read_history_bool_~history_id; 134108#L172-12 assume !(0 == read_history_bool_~historyIndex); 134106#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 134103#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 133936#L307 assume !(0 == check_~tmp___3~0 % 256); 133924#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133921#L151-7 assume 3 == read_history_int8_~history_id; 133913#L152-7 assume !(0 == read_history_int8_~historyIndex); 133282#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 133045#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 133046#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133896#L151-8 assume 3 == read_history_int8_~history_id; 133038#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 133039#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 133040#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 133288#L346-1 [2018-11-18 13:25:47,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034201, now seen corresponding path program 2 times [2018-11-18 13:25:47,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:47,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:47,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:47,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:47,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:25:47,486 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:25:47,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:25:47,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:25:47,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:25:47,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:47,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:25:47,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 13:25:47,623 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:25:47,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:25:47,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1226239372, now seen corresponding path program 1 times [2018-11-18 13:25:47,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:25:47,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:25:47,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:25:47,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:25:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:25:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:25:48,356 WARN L180 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 244 [2018-11-18 13:25:49,898 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 189 DAG size of output: 170 [2018-11-18 13:25:49,901 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:25:49,901 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:25:49,901 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:25:49,902 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:25:49,902 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:25:49,902 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:49,902 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:25:49,902 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:25:49,902 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration30_Loop [2018-11-18 13:25:49,902 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:25:49,902 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:25:49,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,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-18 13:25:49,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,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-18 13:25:49,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,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-18 13:25:49,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-18 13:25:49,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:49,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,143 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-18 13:25:50,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,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-18 13:25:50,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:25:50,461 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-18 13:25:50,505 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:25:58,490 WARN L180 SmtUtils]: Spent 7.89 s on a formula simplification. DAG size of input: 260 DAG size of output: 156 [2018-11-18 13:25:58,519 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:25:58,520 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 162 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 162 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,529 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,530 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 163 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 163 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,549 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,550 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 164 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 164 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,569 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,569 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,570 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,571 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 165 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 165 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,585 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,588 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,588 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 166 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 166 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,605 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 167 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 167 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,624 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,624 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post17=0} Honda state: {ULTIMATE.start_check_#t~post17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 168 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 168 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,644 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,644 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0=0} Honda state: {ULTIMATE.start_check_~tmp___13~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 169 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 169 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,661 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 170 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 170 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,687 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,687 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 171 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 171 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,704 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,704 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_25=-1} Honda state: {v_rep#funAddr~voter.base_25=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 172 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 172 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,743 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,743 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_25=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 173 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 173 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,747 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,747 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 174 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 174 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,771 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,771 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 175 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 175 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,794 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 176 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 176 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:25:58,829 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:25:58,829 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_25=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_25=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 177 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 177 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,831 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:25:58,831 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 178 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 178 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:25:58,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:25:58,859 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:10,903 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 13:26:10,908 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:26:10,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:26:10,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:26:10,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:26:10,908 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:26:10,908 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:10,908 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:26:10,908 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:26:10,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration30_Loop [2018-11-18 13:26:10,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:26:10,909 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:26:10,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:10,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,063 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-18 13:26:11,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,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-18 13:26:11,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-18 13:26:11,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,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-18 13:26:11,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,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-18 13:26:11,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:11,333 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-18 13:26:11,526 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:26:19,409 WARN L180 SmtUtils]: Spent 7.87 s on a formula simplification. DAG size of input: 260 DAG size of output: 156 [2018-11-18 13:26:19,523 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:26:19,523 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:26:19,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,524 INFO L206 nArgumentSynthesizer]: 24 loop disjuncts [2018-11-18 13:26:19,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,536 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-18 13:26:19,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:19,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:19,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:19,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:19,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:19,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:19,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:19,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:19,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:19,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:19,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:19,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:19,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:19,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:19,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:19,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:19,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:19,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:19,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:19,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:26:19,689 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:26:19,689 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:26:19,689 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:26:19,689 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:26:19,690 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:26:19,690 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-18 13:26:19,780 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:26:19,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:26:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:26:19,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:26:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:26:19,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:26:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:26:19,961 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:26:19,961 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1884 states and 2394 transitions. cyclomatic complexity: 518 Second operand 5 states. [2018-11-18 13:26:20,001 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1884 states and 2394 transitions. cyclomatic complexity: 518. Second operand 5 states. Result 4819 states and 6097 transitions. Complement of second has 6 states. [2018-11-18 13:26:20,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:26:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:26:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2018-11-18 13:26:20,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 475 transitions. Stem has 108 letters. Loop has 61 letters. [2018-11-18 13:26:20,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:26:20,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 475 transitions. Stem has 169 letters. Loop has 61 letters. [2018-11-18 13:26:20,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:26:20,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 475 transitions. Stem has 108 letters. Loop has 122 letters. [2018-11-18 13:26:20,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:26:20,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4819 states and 6097 transitions. [2018-11-18 13:26:20,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 571 [2018-11-18 13:26:20,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4819 states to 1104 states and 1390 transitions. [2018-11-18 13:26:20,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1053 [2018-11-18 13:26:20,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1053 [2018-11-18 13:26:20,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1104 states and 1390 transitions. [2018-11-18 13:26:20,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:26:20,020 INFO L705 BuchiCegarLoop]: Abstraction has 1104 states and 1390 transitions. [2018-11-18 13:26:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states and 1390 transitions. [2018-11-18 13:26:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 458. [2018-11-18 13:26:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-11-18 13:26:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 574 transitions. [2018-11-18 13:26:20,038 INFO L728 BuchiCegarLoop]: Abstraction has 458 states and 574 transitions. [2018-11-18 13:26:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:26:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:26:20,038 INFO L87 Difference]: Start difference. First operand 458 states and 574 transitions. Second operand 5 states. [2018-11-18 13:26:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:26:20,180 INFO L93 Difference]: Finished difference Result 594 states and 738 transitions. [2018-11-18 13:26:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:26:20,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 594 states and 738 transitions. [2018-11-18 13:26:20,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2018-11-18 13:26:20,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 594 states to 570 states and 712 transitions. [2018-11-18 13:26:20,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 425 [2018-11-18 13:26:20,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 425 [2018-11-18 13:26:20,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 712 transitions. [2018-11-18 13:26:20,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:26:20,184 INFO L705 BuchiCegarLoop]: Abstraction has 570 states and 712 transitions. [2018-11-18 13:26:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 712 transitions. [2018-11-18 13:26:20,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 485. [2018-11-18 13:26:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-11-18 13:26:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 609 transitions. [2018-11-18 13:26:20,187 INFO L728 BuchiCegarLoop]: Abstraction has 485 states and 609 transitions. [2018-11-18 13:26:20,187 INFO L608 BuchiCegarLoop]: Abstraction has 485 states and 609 transitions. [2018-11-18 13:26:20,187 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-18 13:26:20,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 609 transitions. [2018-11-18 13:26:20,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2018-11-18 13:26:20,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:26:20,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:26:20,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:26:20,189 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] [2018-11-18 13:26:20,189 INFO L794 eck$LassoCheckResult]: Stem: 141715#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 141578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141579#L116-3 assume true; 141796#L116-1 assume !!(add_history_type_~var~0 < 3); 141848#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141846#L171 assume 0 == read_history_bool_~history_id; 141843#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 141840#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 141838#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 141809#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141797#L116-3 assume true; 141798#L116-1 assume !!(add_history_type_~var~0 < 3); 141775#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141675#L171 assume 0 == read_history_bool_~history_id; 141676#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 141564#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 141669#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 141670#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141833#L116-3 assume true; 141800#L116-1 assume !(add_history_type_~var~0 < 3); 141794#L116-4 add_history_type_#res := 1; 141688#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 141689#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141767#L116-8 assume true; 141803#L116-6 assume !!(add_history_type_~var~0 < 3); 142018#L117-2 assume !(0 == add_history_type_~history_id); 142017#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 142016#L171-4 assume !(0 == read_history_bool_~history_id); 142014#L181-4 assume 1 == read_history_bool_~history_id; 142012#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 142007#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 142005#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 141815#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141804#L116-8 assume true; 141805#L116-6 assume !!(add_history_type_~var~0 < 3); 141764#L117-2 assume !(0 == add_history_type_~history_id); 141765#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141799#L171-4 assume !(0 == read_history_bool_~history_id); 141725#L181-4 assume 1 == read_history_bool_~history_id; 141726#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 141661#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 141602#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 141603#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141834#L116-8 assume true; 141808#L116-6 assume !(add_history_type_~var~0 < 3); 141802#L116-9 add_history_type_#res := 1; 141721#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 141683#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141684#L116-13 assume true; 141782#L116-11 assume !!(add_history_type_~var~0 < 3); 141760#L117-4 assume !(0 == add_history_type_~history_id); 141761#L123-4 assume !(1 == add_history_type_~history_id); 141822#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141807#L171-8 assume !(0 == read_history_bool_~history_id); 141734#L181-8 assume !(1 == read_history_bool_~history_id); 141609#L191-8 assume 2 == read_history_bool_~history_id; 141610#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 141737#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 141587#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 141588#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141783#L116-13 assume true; 141784#L116-11 assume !!(add_history_type_~var~0 < 3); 141762#L117-4 assume !(0 == add_history_type_~history_id); 141763#L123-4 assume !(1 == add_history_type_~history_id); 141821#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141806#L171-8 assume !(0 == read_history_bool_~history_id); 141733#L181-8 assume !(1 == read_history_bool_~history_id); 141607#L191-8 assume 2 == read_history_bool_~history_id; 141608#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 141735#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 141585#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 141586#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141814#L116-13 assume true; 141787#L116-11 assume !(add_history_type_~var~0 < 3); 141780#L116-14 add_history_type_#res := 1; 141718#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 141569#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141570#L116-18 assume true; 141832#L116-16 assume !!(add_history_type_~var~0 < 3); 141751#L117-6 assume !(0 == add_history_type_~history_id); 141752#L123-6 assume !(1 == add_history_type_~history_id); 141818#L129-6 assume !(2 == add_history_type_~history_id); 141654#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141655#L151-3 assume 3 == read_history_int8_~history_id; 141664#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 141665#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 141667#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 141650#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141651#L116-18 assume true; 141790#L116-16 assume !!(add_history_type_~var~0 < 3); 141753#L117-6 assume !(0 == add_history_type_~history_id); 141754#L123-6 assume !(1 == add_history_type_~history_id); 141817#L129-6 assume !(2 == add_history_type_~history_id); 141652#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141653#L151-3 assume 3 == read_history_int8_~history_id; 141662#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 141663#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 141666#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 141648#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 141649#L116-18 assume true; 141789#L116-16 assume !(add_history_type_~var~0 < 3); 141788#L116-19 add_history_type_#res := 1; 141716#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 141717#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 141685#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 141686#L558-3 assume true; 141966#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141963#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 141962#L236-2 assume { :end_inline_write_history_bool } true; 141961#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 141960#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 141958#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 141957#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 141956#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 141955#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141954#L226-2 assume !(0 == write_history_bool_~history_id); 141694#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 141695#L236-5 assume { :end_inline_write_history_bool } true; 141730#L421 assume 0 != ~gate2Failed~0 % 256; 141950#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 141998#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 141997#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141996#L226-4 assume !(0 == write_history_bool_~history_id); 141995#L231-4 assume !(1 == write_history_bool_~history_id); 141994#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 141993#L236-8 assume { :end_inline_write_history_bool } true; 141992#L452 assume 0 != ~gate3Failed~0 % 256; 141991#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 141990#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 141989#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 141988#L486 assume ~VALUE1~0 == ~VALUE2~0; 141987#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 141594#L514-2 [2018-11-18 13:26:20,720 INFO L796 eck$LassoCheckResult]: Loop: 141594#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 141983#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 141975#L211-2 assume { :end_inline_write_history_int8 } true; 141973#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 141894#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 141891#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141889#L171-12 assume 0 == read_history_bool_~history_id; 141888#L172-12 assume !(0 == read_history_bool_~historyIndex); 141887#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 141732#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 141582#L307 assume !(0 == check_~tmp___3~0 % 256); 141583#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141589#L151-7 assume 3 == read_history_int8_~history_id; 141619#L152-7 assume !(0 == read_history_int8_~historyIndex); 141620#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 141621#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 141622#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141750#L151-8 assume 3 == read_history_int8_~history_id; 141616#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 141617#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 141618#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 141740#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141741#L151-9 assume 3 == read_history_int8_~history_id; 141611#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 141612#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 141615#L366 assume check_~tmp___11~0 != ~nomsg~0;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141816#L151-10 assume 3 == read_history_int8_~history_id; 141643#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 141644#L163-10 check_#t~ret24 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 141645#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 141657#L366-1 check_#res := 1; 141646#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 141647#L583-72 assume !(0 == assert_~arg % 256); 141766#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 141774#L558-3 assume true; 141829#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141678#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 141679#L236-2 assume { :end_inline_write_history_bool } true; 141744#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 141728#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 141681#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 141682#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 141795#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 141755#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141673#L226-2 assume !(0 == write_history_bool_~history_id); 141674#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 141952#L236-5 assume { :end_inline_write_history_bool } true; 141826#L421 assume 0 != ~gate2Failed~0 % 256; 141641#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 141613#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 141614#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141723#L226-4 assume !(0 == write_history_bool_~history_id); 141719#L231-4 assume !(1 == write_history_bool_~history_id); 141720#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 141724#L236-8 assume { :end_inline_write_history_bool } true; 141739#L452 assume 0 != ~gate3Failed~0 % 256; 141791#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 141757#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 141758#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 141769#L486 assume !(~VALUE1~0 == ~VALUE2~0); 141770#L493 assume ~VALUE1~0 == ~VALUE3~0; 141986#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 141594#L514-2 [2018-11-18 13:26:21,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:26:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1004694626, now seen corresponding path program 1 times [2018-11-18 13:26:21,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:26:21,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:26:21,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:21,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:26:21,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:26:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 13:26:21,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:26:21,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:26:21,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:26:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:26:21,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:26:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-18 13:26:21,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:26:21,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 13:26:21,394 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:26:21,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:26:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1753500014, now seen corresponding path program 1 times [2018-11-18 13:26:21,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:26:21,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:26:21,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:21,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:26:21,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:26:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:26:22,230 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 244 [2018-11-18 13:26:23,220 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2018-11-18 13:26:23,222 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:26:23,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:26:23,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:26:23,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:26:23,222 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:26:23,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:23,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:26:23,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:26:23,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration31_Loop [2018-11-18 13:26:23,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:26:23,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:26:23,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:23,464 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-18 13:26:23,854 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-18 13:26:23,854 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:26:27,303 WARN L180 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-18 13:26:27,306 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:26:27,306 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 180 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 180 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,312 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,312 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_27=-1} Honda state: {v_rep#funAddr~voter.base_27=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 181 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 181 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,333 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,333 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,336 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 182 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 182 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,351 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,353 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,353 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 183 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 183 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,372 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 184 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 184 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,390 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,390 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 185 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 185 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,405 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,407 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,407 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0=0} Honda state: {ULTIMATE.start_check_~tmp___13~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 186 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 186 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,431 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,431 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 187 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 187 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,469 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,469 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_27=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 188 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 188 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 189 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 189 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,501 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 190 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 190 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,539 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 191 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 191 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,555 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,555 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,557 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,557 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 192 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 192 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,581 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,584 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,584 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 193 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 193 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,607 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,608 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret58=0} Honda state: {ULTIMATE.start_main_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 194 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 194 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,637 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,637 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret10=0} Honda state: {ULTIMATE.start_check_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 195 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 195 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,654 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,654 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 196 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 196 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,671 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,671 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 197 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 197 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,690 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,692 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 198 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 198 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,707 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,709 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,709 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 199 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 199 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,725 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,726 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,727 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret20=0} Honda state: {ULTIMATE.start_check_#t~ret20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 200 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 200 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,744 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 201 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 201 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,761 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,761 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 202 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 202 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,784 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,785 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,786 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 203 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 203 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,810 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,810 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 204 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 204 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,827 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,829 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,829 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 205 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 205 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,847 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 206 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 206 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,869 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,871 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,871 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 207 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 207 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,894 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,894 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 208 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 208 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:27,912 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:27,912 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 209 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 209 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:27,934 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 210 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 210 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:27,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:26:27,976 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:40,016 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 13:26:40,021 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:26:40,021 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:26:40,022 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:26:40,022 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:26:40,022 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:26:40,022 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:40,022 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:26:40,022 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:26:40,022 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration31_Loop [2018-11-18 13:26:40,022 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:26:40,022 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:26:40,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,195 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-18 13:26:40,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:40,507 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-18 13:26:40,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:26:44,021 WARN L180 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-18 13:26:44,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:26:44,129 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:26:44,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:44,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:44,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,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-18 13:26:44,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:44,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:44,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,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-18 13:26:44,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,143 INFO L206 nArgumentSynthesizer]: 12 loop disjuncts [2018-11-18 13:26:44,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,148 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-11-18 13:26:44,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,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-18 13:26:44,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,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-18 13:26:44,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,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-18 13:26:44,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:44,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:44,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,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-18 13:26:44,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:44,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:44,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:44,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:44,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,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-18 13:26:44,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:44,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:44,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:26:44,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:26:44,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:26:44,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:26:44,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:26:44,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:26:44,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:26:44,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:26:44,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:26:44,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:26:44,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:26:44,295 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:26:44,296 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:26:44,296 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:26:44,296 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:26:44,296 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:26:44,296 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:26:44,296 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-18 13:26:44,297 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:26:44,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:26:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:26:44,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:26:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:26:44,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:26:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:26:44,576 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:26:44,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 485 states and 609 transitions. cyclomatic complexity: 129 Second operand 5 states. [2018-11-18 13:26:44,592 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 485 states and 609 transitions. cyclomatic complexity: 129. Second operand 5 states. Result 1073 states and 1351 transitions. Complement of second has 6 states. [2018-11-18 13:26:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:26:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:26:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2018-11-18 13:26:44,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 473 transitions. Stem has 132 letters. Loop has 62 letters. [2018-11-18 13:26:44,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:26:44,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 473 transitions. Stem has 194 letters. Loop has 62 letters. [2018-11-18 13:26:44,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:26:44,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 473 transitions. Stem has 132 letters. Loop has 124 letters. [2018-11-18 13:26:44,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:26:44,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 1351 transitions. [2018-11-18 13:26:44,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-18 13:26:44,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 477 states and 593 transitions. [2018-11-18 13:26:44,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 399 [2018-11-18 13:26:44,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 399 [2018-11-18 13:26:44,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 477 states and 593 transitions. [2018-11-18 13:26:44,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:26:44,598 INFO L705 BuchiCegarLoop]: Abstraction has 477 states and 593 transitions. [2018-11-18 13:26:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states and 593 transitions. [2018-11-18 13:26:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-11-18 13:26:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-18 13:26:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 593 transitions. [2018-11-18 13:26:44,602 INFO L728 BuchiCegarLoop]: Abstraction has 477 states and 593 transitions. [2018-11-18 13:26:44,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:26:44,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:26:44,602 INFO L87 Difference]: Start difference. First operand 477 states and 593 transitions. Second operand 6 states. [2018-11-18 13:26:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:26:44,634 INFO L93 Difference]: Finished difference Result 576 states and 708 transitions. [2018-11-18 13:26:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:26:44,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 708 transitions. [2018-11-18 13:26:44,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-18 13:26:44,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 552 states and 682 transitions. [2018-11-18 13:26:44,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 399 [2018-11-18 13:26:44,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 399 [2018-11-18 13:26:44,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 552 states and 682 transitions. [2018-11-18 13:26:44,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 13:26:44,636 INFO L705 BuchiCegarLoop]: Abstraction has 552 states and 682 transitions. [2018-11-18 13:26:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states and 682 transitions. [2018-11-18 13:26:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 528. [2018-11-18 13:26:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-18 13:26:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 656 transitions. [2018-11-18 13:26:44,638 INFO L728 BuchiCegarLoop]: Abstraction has 528 states and 656 transitions. [2018-11-18 13:26:44,638 INFO L608 BuchiCegarLoop]: Abstraction has 528 states and 656 transitions. [2018-11-18 13:26:44,638 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-18 13:26:44,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 656 transitions. [2018-11-18 13:26:44,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-18 13:26:44,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 13:26:44,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 13:26:44,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:26:44,640 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] [2018-11-18 13:26:44,640 INFO L794 eck$LassoCheckResult]: Stem: 145327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 145190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145191#L116-3 assume true; 145409#L116-1 assume !!(add_history_type_~var~0 < 3); 145692#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145691#L171 assume 0 == read_history_bool_~history_id; 145687#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 145684#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 145683#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 145682#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145681#L116-3 assume true; 145415#L116-1 assume !!(add_history_type_~var~0 < 3); 145384#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145288#L171 assume 0 == read_history_bool_~history_id; 145289#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 145174#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 145282#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 145283#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145410#L116-3 assume true; 145411#L116-1 assume !!(add_history_type_~var~0 < 3); 145679#L117 assume 0 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145677#L171 assume 0 == read_history_bool_~history_id; 145673#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 145669#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 145649#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 145466#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145451#L116-3 assume true; 145414#L116-1 assume !(add_history_type_~var~0 < 3); 145407#L116-4 add_history_type_#res := 1; 145300#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 145301#L255 assume !(0 == init_~tmp~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145379#L116-8 assume true; 145420#L116-6 assume !!(add_history_type_~var~0 < 3); 145376#L117-2 assume !(0 == add_history_type_~history_id); 145377#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145412#L171-4 assume !(0 == read_history_bool_~history_id); 145337#L181-4 assume 1 == read_history_bool_~history_id; 145338#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 145272#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 145213#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 145214#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145651#L116-8 assume true; 145652#L116-6 assume !!(add_history_type_~var~0 < 3); 145663#L117-2 assume !(0 == add_history_type_~history_id); 145662#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145661#L171-4 assume !(0 == read_history_bool_~history_id); 145660#L181-4 assume 1 == read_history_bool_~history_id; 145657#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 145654#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 145653#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 145427#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145421#L116-8 assume true; 145422#L116-6 assume !!(add_history_type_~var~0 < 3); 145650#L117-2 assume !(0 == add_history_type_~history_id); 145465#L123-2 assume 1 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145464#L171-4 assume !(0 == read_history_bool_~history_id); 145462#L181-4 assume 1 == read_history_bool_~history_id; 145458#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 145455#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 145454#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 145453#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145452#L116-8 assume true; 145425#L116-6 assume !(add_history_type_~var~0 < 3); 145419#L116-9 add_history_type_#res := 1; 145333#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 145294#L259 assume !(0 == init_~tmp___0~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145295#L116-13 assume true; 145450#L116-11 assume !!(add_history_type_~var~0 < 3); 145372#L117-4 assume !(0 == add_history_type_~history_id); 145373#L123-4 assume !(1 == add_history_type_~history_id); 145507#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145505#L171-8 assume !(0 == read_history_bool_~history_id); 145504#L181-8 assume !(1 == read_history_bool_~history_id); 145502#L191-8 assume 2 == read_history_bool_~history_id; 145500#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 145497#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 145495#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 145478#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145475#L116-13 assume true; 145473#L116-11 assume !!(add_history_type_~var~0 < 3); 145374#L117-4 assume !(0 == add_history_type_~history_id); 145375#L123-4 assume !(1 == add_history_type_~history_id); 145435#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145424#L171-8 assume !(0 == read_history_bool_~history_id); 145347#L181-8 assume !(1 == read_history_bool_~history_id); 145222#L191-8 assume 2 == read_history_bool_~history_id; 145223#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 145350#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 145199#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 145200#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145395#L116-13 assume true; 145396#L116-11 assume !!(add_history_type_~var~0 < 3); 145398#L117-4 assume !(0 == add_history_type_~history_id); 145449#L123-4 assume !(1 == add_history_type_~history_id); 145434#L129-4 assume 2 == add_history_type_~history_id;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145423#L171-8 assume !(0 == read_history_bool_~history_id); 145346#L181-8 assume !(1 == read_history_bool_~history_id); 145220#L191-8 assume 2 == read_history_bool_~history_id; 145221#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 145348#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 145197#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 145198#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145393#L116-13 assume true; 145394#L116-11 assume !(add_history_type_~var~0 < 3); 145391#L116-14 add_history_type_#res := 1; 145330#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 145181#L263 assume !(0 == init_~tmp___1~1);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145182#L116-18 assume true; 145401#L116-16 assume !!(add_history_type_~var~0 < 3); 145363#L117-6 assume !(0 == add_history_type_~history_id); 145364#L123-6 assume !(1 == add_history_type_~history_id); 145489#L129-6 assume !(2 == add_history_type_~history_id); 145487#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145485#L151-3 assume 3 == read_history_int8_~history_id; 145483#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 145481#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 145479#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 145476#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145474#L116-18 assume true; 145471#L116-16 assume !!(add_history_type_~var~0 < 3); 145365#L117-6 assume !(0 == add_history_type_~history_id); 145366#L123-6 assume !(1 == add_history_type_~history_id); 145430#L129-6 assume !(2 == add_history_type_~history_id); 145267#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145268#L151-3 assume 3 == read_history_int8_~history_id; 145275#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 145276#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 145280#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 145263#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145264#L116-18 assume true; 145402#L116-16 assume !!(add_history_type_~var~0 < 3); 145404#L117-6 assume !(0 == add_history_type_~history_id); 145448#L123-6 assume !(1 == add_history_type_~history_id); 145429#L129-6 assume !(2 == add_history_type_~history_id); 145265#L135-9 assume 3 == add_history_type_~history_id;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145266#L151-3 assume 3 == read_history_int8_~history_id; 145273#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 145274#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 145279#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 145261#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 145262#L116-18 assume true; 145403#L116-16 assume !(add_history_type_~var~0 < 3); 145400#L116-19 add_history_type_#res := 1; 145328#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 145329#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 145298#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 145299#L558-3 assume true; 145630#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145627#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 145626#L236-2 assume { :end_inline_write_history_bool } true; 145625#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 145624#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 145622#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 145621#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 145619#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 145367#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145368#L226-2 assume !(0 == write_history_bool_~history_id); 145612#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 145609#L236-5 assume { :end_inline_write_history_bool } true; 145595#L421 assume 0 != ~gate2Failed~0 % 256; 145591#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 145587#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 145585#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145581#L226-4 assume !(0 == write_history_bool_~history_id); 145577#L231-4 assume !(1 == write_history_bool_~history_id); 145572#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 145567#L236-8 assume { :end_inline_write_history_bool } true; 145566#L452 assume 0 != ~gate3Failed~0 % 256; 145383#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 145370#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 145371#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 145381#L486 assume !(~VALUE1~0 == ~VALUE2~0); 145382#L493 assume ~VALUE1~0 == ~VALUE3~0; 145206#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 145207#L514-2 [2018-11-18 13:26:45,749 INFO L796 eck$LassoCheckResult]: Loop: 145207#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 145666#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 145665#L211-2 assume { :end_inline_write_history_int8 } true; 145664#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 145524#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 145522#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145520#L171-12 assume 0 == read_history_bool_~history_id; 145380#L172-12 assume !(0 == read_history_bool_~historyIndex); 145360#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 145344#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 145345#L307 assume !(0 == check_~tmp___3~0 % 256); 145195#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145201#L151-7 assume 3 == read_history_int8_~history_id; 145232#L152-7 assume !(0 == read_history_int8_~historyIndex); 145233#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 145234#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 145235#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145362#L151-8 assume 3 == read_history_int8_~history_id; 145229#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 145230#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 145231#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 145387#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145648#L151-9 assume 3 == read_history_int8_~history_id; 145226#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 145227#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 145228#L366 assume check_~tmp___11~0 != ~nomsg~0;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145428#L151-10 assume 3 == read_history_int8_~history_id; 145256#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 145257#L163-10 check_#t~ret24 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 145258#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 145270#L366-1 check_#res := 1; 145259#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 145260#L583-72 assume !(0 == assert_~arg % 256); 145378#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 145385#L558-3 assume true; 145445#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145291#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 145292#L236-2 assume { :end_inline_write_history_bool } true; 145357#L390 assume !(0 != ~gate1Failed~0 % 256);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 145340#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 145296#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 145297#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 145408#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 145413#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145286#L226-2 assume !(0 == write_history_bool_~history_id); 145287#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 145305#L236-5 assume { :end_inline_write_history_bool } true; 145342#L421 assume 0 != ~gate2Failed~0 % 256; 145252#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 145224#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 145225#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145582#L226-4 assume !(0 == write_history_bool_~history_id); 145578#L231-4 assume !(1 == write_history_bool_~history_id); 145573#L236-6 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 145568#L236-8 assume { :end_inline_write_history_bool } true; 145564#L452 assume 0 != ~gate3Failed~0 % 256; 145565#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 145676#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 145675#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 145670#L486 assume !(~VALUE1~0 == ~VALUE2~0); 145668#L493 assume ~VALUE1~0 == ~VALUE3~0; 145667#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 145207#L514-2 [2018-11-18 13:26:46,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:26:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1891555786, now seen corresponding path program 1 times [2018-11-18 13:26:46,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:26:46,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:26:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:46,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:26:46,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:26:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-18 13:26:46,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:26:46,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:26:46,423 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 13:26:46,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:26:46,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1753500014, now seen corresponding path program 2 times [2018-11-18 13:26:46,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:26:46,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:26:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:46,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:26:46,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:26:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:26:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:26:47,197 WARN L180 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 244 [2018-11-18 13:26:48,190 WARN L180 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2018-11-18 13:26:48,191 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:26:48,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:26:48,191 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:26:48,191 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:26:48,191 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 13:26:48,191 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:48,191 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:26:48,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:26:48,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration32_Loop [2018-11-18 13:26:48,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:26:48,192 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:26:48,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,377 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-18 13:26:48,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:26:48,681 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-18 13:26:48,877 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:26:52,235 WARN L180 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-18 13:26:52,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:26:52,339 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 211 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 211 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,343 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_29=-1} Honda state: {v_rep#funAddr~voter.base_29=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 212 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 212 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,362 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,362 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,363 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,363 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 213 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-18 13:26:52,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,379 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 213 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,385 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,386 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 214 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 214 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,404 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 215 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 215 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,423 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 216 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 216 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,441 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 217 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 217 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,458 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,458 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 218 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 218 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,483 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 219 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 219 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,515 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,515 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_29=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_29=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 220 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 220 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,517 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,517 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,519 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,519 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret14=0} Honda state: {ULTIMATE.start_check_#t~ret14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 221 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 221 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,543 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,545 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,545 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret58=0} Honda state: {ULTIMATE.start_main_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 222 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 222 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,567 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,567 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,569 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,569 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret10=0} Honda state: {ULTIMATE.start_check_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 223 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 223 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,593 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,593 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 224 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 224 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,611 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,611 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 225 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 225 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,634 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,634 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0=0} Honda state: {ULTIMATE.start_check_~tmp___13~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 226 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 226 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,652 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,652 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 227 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 227 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,672 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,672 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 228 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 228 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:26:52,689 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 13:26:52,689 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 229 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 229 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:52,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 13:26:52,705 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eada402-97f5-4cd7-be6d-a37a95696de5/bin-2019/uautomizer/z3 Starting monitored process 230 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 230 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:26:53,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 13:26:53,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 13:27:05,355 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 13:27:05,378 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 13:27:05,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 13:27:05,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 13:27:05,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 13:27:05,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 13:27:05,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 13:27:05,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 13:27:05,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 13:27:05,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration32_Loop [2018-11-18 13:27:05,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 13:27:05,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 13:27:05,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,611 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-18 13:27:05,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 13:27:05,985 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-18 13:27:06,058 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 13:27:09,440 WARN L180 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-18 13:27:09,496 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 13:27:09,496 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 13:27:09,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:09,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:09,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:09,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:09,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:09,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:09,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:09,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:09,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:09,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:09,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,530 INFO L206 nArgumentSynthesizer]: 12 loop disjuncts [2018-11-18 13:27:09,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,540 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-11-18 13:27:09,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:09,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:09,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 13:27:09,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 13:27:09,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:09,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:09,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:09,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:09,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:09,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:09,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:09,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:09,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:09,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 13:27:10,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 13:27:10,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 13:27:10,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 13:27:10,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 13:27:10,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 13:27:10,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 13:27:10,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 13:27:10,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 13:27:10,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 13:27:10,333 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 13:27:10,333 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 13:27:10,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 13:27:10,333 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 13:27:10,334 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 13:27:10,334 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-18 13:27:10,334 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 13:27:10,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:27:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:10,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:27:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:27:10,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:27:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:27:10,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 13:27:10,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 528 states and 656 transitions. cyclomatic complexity: 133 Second operand 5 states. [2018-11-18 13:27:10,534 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 528 states and 656 transitions. cyclomatic complexity: 133. Second operand 5 states. Result 818 states and 1019 transitions. Complement of second has 6 states. [2018-11-18 13:27:10,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 13:27:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 13:27:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2018-11-18 13:27:10,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 334 transitions. Stem has 174 letters. Loop has 62 letters. [2018-11-18 13:27:10,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:27:10,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 334 transitions. Stem has 236 letters. Loop has 62 letters. [2018-11-18 13:27:10,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:27:10,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 334 transitions. Stem has 174 letters. Loop has 124 letters. [2018-11-18 13:27:10,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 13:27:10,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 818 states and 1019 transitions. [2018-11-18 13:27:10,539 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:27:10,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 818 states to 0 states and 0 transitions. [2018-11-18 13:27:10,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:27:10,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:27:10,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:27:10,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:27:10,539 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:27:10,539 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:27:10,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:27:10,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:27:10,540 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2018-11-18 13:27:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:27:10,540 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 13:27:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:27:10,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 13:27:10,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:27:10,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:27:10,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 13:27:10,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 13:27:10,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 13:27:10,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 13:27:10,541 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:27:10,541 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:27:10,541 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:27:10,691 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-18 13:27:10,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:27:10,692 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 13:27:10,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 13:27:10,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 01:27:10 BoogieIcfgContainer [2018-11-18 13:27:10,698 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 13:27:10,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:27:10,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:27:10,698 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:27:10,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:23:21" (3/4) ... [2018-11-18 13:27:10,701 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 13:27:10,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:27:10,702 INFO L168 Benchmark]: Toolchain (without parser) took 230554.21 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 476.1 MB). Free memory was 960.2 MB in the beginning and 1.3 GB in the end (delta: -301.5 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:27:10,703 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:27:10,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -219.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:27:10,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:27:10,703 INFO L168 Benchmark]: Boogie Preprocessor took 55.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:27:10,704 INFO L168 Benchmark]: RCFGBuilder took 1084.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 146.9 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. [2018-11-18 13:27:10,704 INFO L168 Benchmark]: BuchiAutomizer took 229008.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -244.8 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:27:10,704 INFO L168 Benchmark]: Witness Printer took 3.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:27:10,705 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 957.5 MB in the beginning and 1.2 GB in the end (delta: -219.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1084.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 146.9 MB). Peak memory consumption was 146.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 229008.02 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 291.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -244.8 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 47 terminating modules (32 trivial, 15 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * var + 5 and consists of 5 locations. One deterministic module has affine ranking function -2 * var + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g1v_\old + nomsg and consists of 19 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g1v_\old + nomsg and consists of 19 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -1 * \result + nomsg + -1 * g1v_\old and consists of 19 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. 32 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 228.9s and 33 iterations. TraceHistogramMax:4. Analysis of lassos took 220.6s. Construction of modules took 2.6s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 45. Automata minimization 0.4s AutomataMinimizationTime, 45 MinimizatonAttempts, 24341 StatesRemovedByMinimization, 34 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 2180 states and ocurred in iteration 24. Nontrivial modules had stage [15, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28248 SDtfs, 27429 SDslu, 43969 SDs, 0 SdLazy, 5002 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI17 SILT14 lasso0 LassoPreprocessingBenchmarks: Lassos: inital745 mio100 ax154 hnf107 lsp24 ukn74 mio100 lsp100 div150 bol100 ite100 ukn100 eq176 hnf77 smp100 dnf4723 smp17 tf103 neg99 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 110ms VariablesStem: 0 VariablesLoop: 36 DisjunctsStem: 1 DisjunctsLoop: 24 SupportingInvariants: 0 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 194 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 6 LassoNonterminationAnalysisTime: 77.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...